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 online. The process took 1 day. I interviewed at Amazon in Apr 2010
Interview
I submitted the resume online. HR contacted me in the next day and scheduled a phone interview. The questions including basic OO concept, data structure ( hash, BST). some classic algorithms. For eg:
1. abstract class and interface
2. virtual deconstructor
3. an array of integer with all the numbers occur even times except one number occur odd times, find it.
I was asked to write codes to reverse a string.
The process took 1 day. I interviewed at Amazon (Seattle, WA) in May 2010
Interview
A friend sent in my resume. I had a phone interview within the week. It was a one-hour interview with a software engineer on the team I was applying for. The first question was, "Tell me about an interesting book you read recently." Then we discussed my past experience (I described my master's thesis research), and then we moved on to coding questions. Finally we discussed the position and working at Amazon in general.
Interview questions [3]
Question 1
Extract the N largest floating point numbers from a large file of floating point numbers.
I applied through a recruiter. The process took 1 day. I interviewed at Amazon in Apr 2010
Interview
Got a call from company's recruiter and have a phone interview. The recruiter is very proactive since I originally only get an email and I did not respond to it. Then a week or two later the recruiter called me.
The phone interview is long (around 1hr 15min) The interviewer did not ask many questions on my job but instead ask me several technical questions.
The interviewer is fair but he did not volunteer any hints.
Interview questions [1]
Question 1
Given a binary tree, how do you create a function that can swap the binary tree? (i.e. the left child becomes the right child and vice versa)
From this function you just created, can you create another function that will swap the tree in Alternate level? (i.e. swap 1 level and then the next level does not swap)