K largest elements from a big file or array. Lowest Common ancestor in a Binary Search Tree and Binary Tree. Reverse a linked list in groups of size k. Maximum sum subarray such that no elements are consecutive
Interview questions [1]
Question 1
Implement a stack with push(), pop() and min() in O(1) time.
1 Debugging OA, 1 Leetcode style OA and 1 work simulation OA. After that 1 45 minute Technical Interview. Overall smooth process. Just make sure to pass the OAs which is usually automatic.
A recruiter talked to me about the position. It started with a phone interview. Then the interviewer sent me a task. Amazon gave me like a week or so to solve it.