Recruiter reaches out after applying through Amazon careers, no referral. Had an initial OA, then after a month had four rounds in two days - three coding one system design. Each round had 30 min behavioral and 30 min coding.
Interview questions [1]
Question 1
Questions were mainly hashmap, sliding window and interval related.
I applied online. The process took 2 weeks. I interviewed at Amazon in Jun 2011
Interview
They asked the questions as below:
1. Why do you want to join Amazon?
2. Which part would you like to join? Front end- Back end or more broader side?
3. Difference between Array and Linked list?
4. Retrieval in an array and a linked list?
5. Insertion in an array and a linked list?
6. What if the array is full?
7. Big 0 of insertion in an array and a linked list?
8. WAP to check whether the string is a palindrome?
9. Take an example and support your answer.
10. Big 0 of the program you made just now.
11. Difference between binary search tree and Hash Table.
12. What will be the big 0 of searching in binary tree and hash table
13. Worst case scenario in Binary Search tree
14. How do you solve collision problems in a Hash Table.
15. WAP using two queues, queue 1 and queue 2 and insert into the stack. The three functions that are allowed to use are: Size(), Enqueue(), and Dequeue.
The phone screen went longer than expected, focusing heavily on implementation details. The interviewer really grilled me on my approach to a Least Recently Used (LRU) cache, asking how I'd combine a hashmap with a doubly linked list. I felt well-prepared since I had gone through system design examples on PracHub, which made me comfortable discussing eviction policies. The later rounds included more technical questions and behavioral interviews, but in the end, I received an offer, though I ultimately decided to decline. Overall, I’d say the process was average, with solid questions.
Interview questions [1]
Question 1
Design and implement a Least Recently Used (LRU) cache supporting get(key) and put(key, value) in O(1) average time. Walk through combining a hashmap with a doubly linked list, eviction policy when capacity is exceeded, and how you'd extend it to handle thread-safe concurrent access.
Interview by recuriter, Phone interview over Chime with one easy Leet code problem and 2 behavioral questions. Although the interviewer was very casual at the start of the conversation, it quickly changed into behavioral questions at the start.
Interview questions [1]
Question 1
Encoding optimization algorithm and talk about a project you did recently.