I applied through college or university. The process took 5 weeks. I interviewed at Amazon
Interview
Most of the details of the onsite interview are given once you are past the initial screening.
The interview process can differ from one batch of applicant to another.
In my case, I was asked to show up at around 10:30-11:00 AM. When I arrived, there was about 30 other candidates waiting to be interviewed. At around 11:30 AM, the recruiter came in and and lead us to a room where we can have lunch with the full-time engineers ; this was the time to ask them about their work, company culture, Seattle etc.
Afterwards, each candidate is led to a separate room were they would be interviewed individually. Overall, I had four 45min interviews over 3 hours. They were all technical.
Interview questions [1]
Question 1
Given a square matrix, implement a function to rotate the matrix 90 degrees.
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.