Round 1: (Written – Pen & Paper)
- Lowest common ancestor in binary search tree
- Remove minimum characters from two strings to become anagram
Round 2: Face to Face
Interviewer was expecting full production level code with optimum time/space complexity.
- Find an element in an unsorted array such that all left elements are smaller and all right elements are greater. O(n) time complexity solution is required.
GeeksforGeeks Link - Find kth smallest element in row wise column wise sorted matrix.
GeeksforGeeks Link
Round 3: Face to Face
Interviewer was first expecting to explain clear algorithm and then production level code.
Round 4: Hiring Manager Round
- Discussed thoroughly about my company project. My contribution in project.
- Boundary traversal of a binary tree
- Why Amazon. Why Chennai.
Hoping for call for Bar Raiser round.