I applied online. The process took 2 months. I interviewed at Amazon in Feb 2013
Interview
I applied for new grad position through their careers.
After 20 days I got a mail from one of their recruiter and asked me to complete assessment test within 7 days.
Test consisted of 3 coding questions and they should be coded within 90 minutes in your favorite language.
Questions:
1. Test whether linked list is cyclist or not.
2. Print k closest points to origin out of n points in a XY coordinate system.
3. I don't exactly remember the third one, but it was related to arrays.
After 2 weeks I got a mail from recruiter saying that they want to go with other candidates.
Interview questions [1]
Question 1
1. Test whether linked list is cyclist or not.
2. Print k closest points to origin out of n points in a XY coordinate system.
3. I don't exactly remember the third one, but it was related to arrays.
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.
Recruiter reaches out after applying through Amazon careers, no referral. Had an initial OA, then after a month had four rounds in two days - three coding one system design. Each round had 30 min behavioral and 30 min coding.
Interview questions [1]
Question 1
Questions were mainly hashmap, sliding window and interval related.
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.