I applied through university. The process took 1 week. I interviewed at Amazon (Los Angeles, CA) in Mar 2013
Interview
I went to a career fair and did not need to apply online, I was contacted through email. I signed up for an on-campus interview, but did not make it past the first round. If I had, I would have been flown up to Seattle for the second round with multiple teams interviewing me. Oddly I did not have a phone screening, just two one-on-one interview.
Interview questions [1]
Question 1
Imagine you are implementing your own arithmetic operations. Explain how and what functions you would need to define to implement the basic arithmetic operations like +,-,/,* (e.g. allow operator overloading, think about how bits are manipulated to do the operations).
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.