Software Engineer applicants have rated the interview process at Amazon with 3.3 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 33% positive. To compare, the company-average is 50% positive. This is according to Glassdoor user ratings.
Common stages of the interview process at Amazon as a Software Engineer according to 3 Glassdoor interviews include:
One on one interview: 100%
Here are the most commonly searched roles for interview reports -
Online Assessment + 2 coding rounds + 1 system design + 1 Hiring manager round. The interview was basically virtual and the coding round happened on hackerrank platform. It had mostly leetcode medium to hard level questions and mostly was designed to code in Object oriented style.
Interview questions [1]
Question 1
Bit manipulation related coding question to be implemented in OO style
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.