Software Engineer applicants have rated the interview process at Amazon with 3.5 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 63.8% positive. This is according to Glassdoor user ratings.
Here are the most commonly searched roles for interview reports -
I applied through a recruiter. The process took 2 weeks. I interviewed at Amazon (Seattle, WA) in Aug 2012
Interview
I went though two telephone screens/interviews before being flown to Seattle for a day of interviews on site. The telephone interviews were typical computer science interview questions - mostly around data structures and file systems.
The on site interview was 5 part with 5 different people for about an hour a piece starting at 11am and going through the afternoon. Multiple interviewers were former Microsoft employees and spent a significant amount of time talking about what they left behind at Microsoft. One interviewer was very confrontational.
I followed through with the day but a couple of hours in I decided I had no desire to work for Amazon.
I applied through college or university. The process took 1+ week. I interviewed at Amazon (Boulder, CO) in Jan 2016
Interview
I receive the email for test 2 weeks after apply on line, and then I take the online quiz. The online quiz is to find the longest not repeat substring.
I applied online. The process took 4 weeks. I interviewed at Amazon (Seattle, WA) in Jan 2016
Interview
I took an online assessment which was mostly finding small bugs in programs. Next was a 45-1 hour phone interview. Both the online assessment and phone interview were pretty simple. I thought I did pretty well but still I did not get an offer. The interviewer was pretty nice and was helpful on some of the questions.
Interview questions [1]
Question 1
It was all technical questions. First question was to write a fizzbuzz program. Second questions was, given two lists containing names, find the common names in the lists. Third question was, given an array in an ascending order, and given that you know that there is at least one integer missing from the array, determine this number. I was also asked complexity of binary trees. The interviewer was a nice guy. He was so cool.