Filter interviews by
I applied via Naukri.com and was interviewed in Sep 2019. There was 1 interview round.
Top trending discussions
I applied via campus placement at National Institute of Technology (NIT), Durgapur and was interviewed in Sep 2022. There were 3 interview rounds.
1 DP question, 1 simple integer manipulation
Find the 4th smallest element in a Binary Search Tree.
Traverse the BST in-order and keep track of the count of visited nodes.
When the count reaches 4, return the current node's value.
If the BST has less than 4 nodes, return null or throw an exception.
Find maximum distinct elements in every sliding window of size k.
Create a hash table to store the frequency of each element in the current window.
Use two pointers to maintain the current window and slide it over the array.
Update the hash table for each new element in the window and remove the old element.
Keep track of the maximum number of distinct elements seen so far.
Repeat until all windows of size k have been proce
Merge two sorted linked lists
Create a new linked list to store the merged list
Compare the first nodes of both lists and add the smaller one to the new list
Move the pointer of the added node to the next node
Repeat until one of the lists is empty
Add the remaining nodes of the non-empty list to the new list
posted on 23 Aug 2024
I applied via Company Website and was interviewed in Feb 2024. There was 1 interview round.
I applied via campus placement at National Institute of Technology (NIT), Durgapur and was interviewed in Sep 2022. There were 3 interview rounds.
1 DP question, 1 simple integer manipulation
Find the 4th smallest element in a Binary Search Tree.
Traverse the BST in-order and keep track of the count of visited nodes.
When the count reaches 4, return the current node's value.
If the BST has less than 4 nodes, return null or throw an exception.
Find maximum distinct elements in every sliding window of size k.
Create a hash table to store the frequency of each element in the current window.
Use two pointers to maintain the current window and slide it over the array.
Update the hash table for each new element in the window and remove the old element.
Keep track of the maximum number of distinct elements seen so far.
Repeat until all windows of size k have been proce
Merge two sorted linked lists
Create a new linked list to store the merged list
Compare the first nodes of both lists and add the smaller one to the new list
Move the pointer of the added node to the next node
Repeat until one of the lists is empty
Add the remaining nodes of the non-empty list to the new list
I applied via Walk-in and was interviewed in Mar 2022. There were 3 interview rounds.
posted on 23 Jul 2022
I applied via Referral and was interviewed before Nov 2020. There was 1 interview round.
Executive Accountant
5
salaries
| ₹3 L/yr - ₹4.5 L/yr |
Assistant Manager
4
salaries
| ₹5.4 L/yr - ₹10.2 L/yr |
Accountant
4
salaries
| ₹2.5 L/yr - ₹3.7 L/yr |
Accounts Manager
3
salaries
| ₹4 L/yr - ₹12 L/yr |
Cognizant
Deloitte
BYJU'S
Teleperformance