Filter interviews by
posted on 31 Mar 2022
I applied via Naukri.com and was interviewed before Mar 2021. There were 2 interview rounds.
I applied via Naukri.com and was interviewed in Jul 2020. There was 1 interview round.
I applied via LinkedIn and was interviewed before Sep 2020. There were 4 interview rounds.
I applied via Naukri.com and was interviewed before Jul 2020. There were 3 interview rounds.
Program on array
Arrays are used to store multiple values in a single variable
Arrays can be of any data type
Arrays can be accessed using index numbers
Arrays can be sorted and searched
I applied via Campus Placement and was interviewed before Nov 2019. There were 6 interview rounds.
I applied via Walk-in and was interviewed before Apr 2021. There were 3 interview rounds.
Process for freshers-
Go through RS Agarwal book and be ready for logical reasoning questions
Criteria for selection is 75% so make sure to select right ans
There will be 2 questions based on selected language
And questions on general English.
I appeared for an interview in Jul 2019.
Design a traffic signal system
Identify the number of lanes and intersections
Determine the traffic flow and peak hours
Choose appropriate sensors and controllers
Implement a synchronization algorithm
Consider emergency vehicle prioritization
Include pedestrian crossing signals
Ensure compliance with local regulations
Hashmap is a data structure that stores key-value pairs and provides constant time complexity for insertion, deletion, and retrieval.
Hashmap uses hashing function to map keys to indices in an array
Collisions can occur when multiple keys map to the same index, which can be resolved using separate chaining or open addressing
Java implementation: HashMap
Printing patterns using code
Identify the pattern to be printed
Use loops to print the pattern
Adjust the loop variables to control the pattern
Use conditional statements to modify the pattern
Examples: printing stars, triangles, squares, etc.
Common point in linked list refers to the node where two or more linked lists intersect.
The common point can be found by traversing both linked lists and comparing the nodes.
The common point can also be found by using two pointers, one for each linked list, and moving them until they meet at the common point.
Examples include finding the intersection point of two linked lists or finding the loop in a linked list.
I applied via Referral
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Software Developer
7
salaries
| ₹3 L/yr - ₹17 L/yr |
Servicenow Developer
7
salaries
| ₹6 L/yr - ₹11 L/yr |
Senior Software Engineer
5
salaries
| ₹22.2 L/yr - ₹48.5 L/yr |
Content Data Analyst
5
salaries
| ₹2.8 L/yr - ₹3.5 L/yr |
Software Engineer
4
salaries
| ₹22 L/yr - ₹25 L/yr |
Oracle
Amdocs
Carelon Global Solutions
Automatic Data Processing (ADP)