Filter interviews by
Hacker Rank test with string and arrays
Top trending discussions
I applied via Campus Placement and was interviewed in Jun 2022. There was 1 interview round.
Count occurrences of a given element in a sorted array.
Use binary search to find the first and last occurrence of the element.
Subtract the indices to get the count.
Handle edge cases like element not present in the array.
Find the deepest left node in a binary tree.
Traverse the tree recursively and keep track of the depth and whether the current node is a left node.
If the current node is a leaf node and its depth is greater than the deepest left node found so far, update the deepest left node.
Return the deepest left node found.
Example: For the binary tree with root node 1, left child 2, and left child of 2 being 4, the deepest left node...
I applied via Campus Placement and was interviewed in Sep 2024. There was 1 interview round.
I was asked to do a string based hard level question. Interviewerr asked me how the code worked and the logic which i explained step by step.
2 hours mcqs from all cse related topics + 1 coding question
3 coding questions easy level
I applied via Campus Placement and was interviewed before Oct 2022. There were 4 interview rounds.
1 hour long test, 1 easy and 1 medium leetcode problem + some apti questions.
Find the next permutation of a given timestamp in HH:MM AM/PM format.
Convert the timestamp to a 24-hour format for easier manipulation.
Identify the rightmost pair where the earlier digit is smaller than the later one.
Swap this digit with the smallest larger digit to its right.
Reverse the digits to the right of the swapped position to get the next permutation.
Example: For '11:55 PM', the next permutation is '12:00 AM'.
I applied via AngelList and was interviewed before Nov 2021. There were 4 interview rounds.
2 coding question level easy-medium leetcode
Easy lc or medium lc quest
It was mcqs with one coding question
It consisted of 2 medium coding ques
The majority element in an array appears more than n/2 times. We can find it using various algorithms.
Use Boyer-Moore Voting Algorithm for O(n) time and O(1) space complexity.
Example: In [3, 2, 3], the majority element is 3.
Another method is using a hash map to count occurrences.
Example: In [1, 1, 2, 2, 2], the majority element is 2.
It was a 2 hour test having 2 coding questions . Difficulty was easy and medium.
I applied via LinkedIn and was interviewed before Aug 2023. There were 2 interview rounds.
Don;t remember the leetcode question, was medium
Don't remember the leetcode qyuestion, was medium, had a behavior component, remember the Amazon principles
based on 1 interview experience
Customer Service Associate
2.9k
salaries
| ₹1.8 L/yr - ₹6 L/yr |
Transaction Risk Investigator
1.4k
salaries
| ₹2.9 L/yr - ₹6.5 L/yr |
Customer Service Executive
911
salaries
| ₹1.8 L/yr - ₹5.7 L/yr |
Senior Associate
848
salaries
| ₹2.5 L/yr - ₹10.5 L/yr |
Associate
685
salaries
| ₹1.4 L/yr - ₹6 L/yr |
Amazon
Flipkart
Indiamart Intermesh
Udaan