I applied online. The process took 3 weeks. I interviewed at Amazon (Seattle, WA) in May 2011
Interview
I had 2 phone screens, which were quite pleasant. In both they asked a few general programming knowledge questions, then a "write some code". The code was simple, atoi() function and tree ordering. Each phone screen was very laid back, took about an hour.
The physical interview was grueling. Not necessarily the questions, they were fairly standard programming questions, but the length of the interview. I was assigned to interview with 2 teams at once so I was there for 7.5 hours all totaled.
Interview questions [1]
Question 1
There was a question that was a Dutch National Flag problem. It is essentially about grouping colors, however he used integers, positive, negate, and zero to do the same thing.
Interviewed for silicon team. Have only been asked about the domain specific knowledge in 1st round and system design in 2nd round and C coding in 3rd round.
The interviews were 50 mins each.
First round with hr screening - 2 leetcode questions then hr manager screening then the loop which consists of 4 interviews each an hour long. The 4 interview questions they asked where three medium leetcode questions. And one system design interview question about how to shadow deploy a test software to millions of users.
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.