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.
I applied through an employee referral. The process took 3 weeks. I interviewed at Amazon in Jun 2012
Interview
At most three phone interviews and 1 on-site interview (with all expenses paid). Each phone interview is with a different person from a different department.
Studying the interview questions posted here on Glassdoor will help you.
Phone Interview 1:
Why do you want to work for Amazon?
What is the hardest engineering problem you've faced? (Prepare for them to question you a lot about details)
How would you improve the Amazon website?
Questions about Java (difference between abstract and interface, etc.)
Write a program that computes the Fibonacci number that is less than or equal to a given number.
Phone Interview 2:
What is the hardest engineering problem you've faced? (Same as above, but different interviewer)
Do you know what a hash map is?
Big-O Questions (give an algorithm that is as time efficient as possible, no programming required)
1. How would you sort 1 million integers?
2. How would you make sure two lists had the exact same content with no regard to order?
Interview questions [3]
Question 1
Write a program that computes the Fibonacci number that is less than or equal to a given number.
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.