Filter interviews by
Clear (1)
I applied via LinkedIn and was interviewed in May 2024. There was 1 interview round.
Calculate the maximum amount of water that can be trapped between given bars.
Use two pointers approach to keep track of the left and right boundaries.
Calculate the water trapped at each bar and update the maximum water trapped.
Move the pointers towards each other until they meet.
Example: Given bars [0,1,0,2,1,0,1,3,2,1,2,1], the maximum water trapped is 6 units.
Find the Kth most occurring element in an array of strings.
Count the frequency of each element in the array.
Sort the elements based on their frequency.
Return the Kth element from the sorted list.
Top trending discussions
I applied via Campus Placement and was interviewed before Jun 2023. There was 1 interview round.
I applied via Approached by Company and was interviewed in Jul 2023. There were 3 interview rounds.
Arrays, LinkedList basic dsa questions
To find the 2nd largest node in a binary tree, we can perform an in-order traversal and keep track of the two largest nodes.
Perform an in-order traversal of the binary tree
Keep track of the two largest nodes encountered
Return the second largest node when traversal is complete
I applied via Campus Placement and was interviewed before Jan 2023. There were 2 interview rounds.
Easy coding question generally A, B level question of codeforces
JavaScript questions
I applied via Campus Placement and was interviewed before Feb 2023. There were 2 interview rounds.
Topics:-
Duration-1.5 hours
Kadane's Algorithm, Even Numbers at even index & odd at odd index, print out the second highest node of the tree
ZigZag tree traversal is a method to traverse a binary tree in a zigzag pattern.
In ZigZag tree traversal, we visit the nodes of a binary tree in a zigzag pattern, moving from left to right and then right to left.
We can use a stack or a queue to implement ZigZag tree traversal.
The algorithm involves maintaining two stacks or two queues to keep track of the nodes at each level.
We start with the root node and alternate be...
DS/ALGO and problem-solving was asked in round one
I applied via Naukri.com and was interviewed in Jul 2020. There were 4 interview rounds.
Check if a tree is binary or not
I applied via LinkedIn and was interviewed before Jan 2024. There were 2 interview rounds.
based on 1 interview
Interview experience
Senior Executive
81
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer Support Executive
45
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
42
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
41
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer Success Executive
39
salaries
| ₹0 L/yr - ₹0 L/yr |
Zerodha
Sharekhan
Paytm Money
ET Money