Amazon Interview Experience | Set 342 (Off-Campus for SDE-1) Last Updated : 09 Jul, 2019 Improve Improve Like Article Like Save Share Report 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. Find the number of islands K’th Smallest/Largest Element in Unsorted Array 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. All Practice Problems for Amazon ! Related Practice Problems Element with left side smaller and right side greater Like Article Suggest improvement Previous Amazon Interview Experience for SDE-1(On-Campus) Next Number of even substrings in a string of digits Share your thoughts in the comments Add Your Comment Please Login to comment...