i
TO THE
NEW
Filter interviews by
Implementation of a linked list
Define a Node class with data and next pointer
Create a LinkedList class with head pointer
Implement methods to add, delete, and traverse nodes
Handle edge cases like empty list or deleting head node
A program to find unique characters in a word.
Create an empty array to store unique characters.
Loop through each character in the word.
If the character is not already in the array, add it.
Return the array of unique characters.
Abstraction is a concept of hiding implementation details while interface is a blueprint of a class.
Abstraction is achieved through abstract classes and methods
Interface is a contract that defines the behavior of a class
Abstraction focuses on hiding complexity while interface focuses on providing a common standard
Abstraction can have implementation details while interface cannot
A class can implement multiple inter...
Encapsulation is the process of hiding implementation details and exposing only necessary information.
Encapsulation helps in achieving data abstraction and information hiding
It prevents unauthorized access to data and protects data from external interference
It allows for easy modification of implementation without affecting the rest of the code
Example: A class in Java with private variables and public methods
WAP to sort an array using quick sort
Choose a pivot element from the array
Partition the array into two sub-arrays based on the pivot
Recursively sort the sub-arrays
Combine the sorted sub-arrays
I applied via Campus Placement
It was an aptitude test that contains questions from - Work, Clock, Percentage, Speed, Profit Loss, Calendar, Charts, and Reasoning.
English - Active Passive, Word Meanings, Error Spotting.
Hackerrank: String Manipulation, Prime, Armstong number, Fibonacci
Time: 60Min.
Write HTML code to design the form for given design on the question paper.
I applied via Campus Placement and was interviewed in May 2019. There were 4 interview rounds.
A program to find unique characters in a word.
Create an empty array to store unique characters.
Loop through each character in the word.
If the character is not already in the array, add it.
Return the array of unique characters.
Top trending discussions
I applied via first naukari and was interviewed before Oct 2020. There were 4 interview rounds.
To find the shortest path in a graph stored in SQL, use algorithms like Dijkstra's or A* with SQL queries for traversal.
Use Dijkstra's algorithm for weighted graphs to find the shortest path efficiently.
For unweighted graphs, consider using Breadth-First Search (BFS).
Store graph edges in a table with columns for source, destination, and weight.
Example SQL query: SELECT * FROM edges WHERE source = 'A' AND destination = ...
I appeared for an interview in Sep 2020.
posted on 16 Apr 2021
I applied via Referral and was interviewed in Oct 2020. There was 1 interview round.
I appeared for an interview in Sep 2019.
I applied via Naukri.com and was interviewed in Sep 2020. There were 3 interview rounds.
I appeared for an interview before Nov 2020.
I applied via Naukri.com and was interviewed in Apr 2021. There was 1 interview round.
based on 2 reviews
Rating in categories
Senior Software Engineer
712
salaries
| ₹13.3 L/yr - ₹24 L/yr |
Software Engineer
592
salaries
| ₹4.7 L/yr - ₹11.5 L/yr |
Associate Technical Leader
243
salaries
| ₹22 L/yr - ₹36 L/yr |
Devops Engineer
185
salaries
| ₹8 L/yr - ₹14 L/yr |
Senior Quality Engineer
171
salaries
| ₹11.4 L/yr - ₹21.1 L/yr |
ITC Infotech
CMS IT Services
KocharTech
Xoriant