The process took 3 weeks. I interviewed at Amazon (Seattle, WA) in Nov 2010
Interview
The first conversation was just a phone conversation with a recruiter to talk about the position. A week later, I had a phone interview that was mostly focused around me explaining my skills and current job and it included one programming question. I had a second interview a couple of weeks later, also over the phone, that was entirely focused around programming using a site to let the recruiter see me code solutions to various problems. She did a poor job of explaining the problem and, when asked specific questions, was unable to explain what she was really looking for. After I completed a solution to one problem, she realized that she forgot to tell me all of the requirements, so my solution didn't work. When I asked her about the position, she didn't know anything.
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.