Filter interviews by
I applied via Referral and was interviewed in Jul 2020. There were 3 interview rounds.
Detect if two circular linked lists overlap
Traverse both lists and check if they have the same tail node
If they have different tail nodes, they do not overlap
If they have the same tail node, check if they intersect at any point
Use Floyd's cycle-finding algorithm to detect intersection point
posted on 31 Mar 2022
I applied via Naukri.com and was interviewed before Mar 2021. There were 2 interview rounds.
I applied via Company Website and was interviewed before Jul 2021. There were 2 interview rounds.
Data Structure related questions
They called me for javascript development when i was a java developer. But they took 2 rouds which went well.
Check if a linked list is circular by using two pointers moving at different speeds.
Initialize two pointers, slow and fast, both pointing to the head of the linked list.
Move slow pointer by one node and fast pointer by two nodes in each iteration.
If the fast pointer reaches the end of the list or meets the slow pointer, the list is circular.
I applied via Recruitment Consulltant and was interviewed in Apr 2022. There were 5 interview rounds.
Minimum 2 platforms required for a railway station.
At least 2 platforms are required for trains to arrive and depart simultaneously.
Additional platforms may be required based on the frequency of trains and passenger traffic.
Platforms should be long enough to accommodate the longest trains that will use the station.
Platforms should also have appropriate facilities for passengers, such as seating, shelter, and signage.
Find set of numbers from an array that can form nearest sum to the given number.
Sort the array in ascending order
Use two pointers approach to find the nearest sum
Return the set of numbers
Trapping Rain Water Problem
The problem involves calculating the amount of water trapped between bars in a histogram
The solution involves finding the maximum height of bars on both sides of each bar and subtracting the height of the bar itself
This can be done using two arrays to store the maximum height of bars on the left and right side of each bar
The problem is to find the least cost to travel from source to destination using dynamic programming.
Use dynamic programming to solve the problem
Create a 2D array to store the minimum cost to reach each cell
Fill the array using the recurrence relation: minCost[i][j] = cost[i][j] + min(minCost[i-1][j], minCost[i][j-1], minCost[i-1][j-1])
The final answer will be stored in minCost[m][n], where m and n are the coordinates ...
Level order traversal of Binary tree
Use a queue to traverse the tree level by level
Enqueue the root node and then dequeue it and enqueue its children
Repeat until the queue is empty
I appeared for an interview in Aug 2023.
posted on 20 Jun 2024
I applied via LinkedIn and was interviewed before Jun 2023. There was 1 interview round.
based on 1 interview
Interview experience
Software Engineer
7
salaries
| ₹25 L/yr - ₹33 L/yr |
Senior Software Engineer
6
salaries
| ₹30 L/yr - ₹98.5 L/yr |
Data Scientist
5
salaries
| ₹15.5 L/yr - ₹33.5 L/yr |
Engineering Manager
5
salaries
| ₹40 L/yr - ₹60 L/yr |
Machine Learning Engineer
4
salaries
| ₹15.5 L/yr - ₹33 L/yr |
Oracle
Amdocs
Automatic Data Processing (ADP)
24/7 Customer