Software Engineer I 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 Dec 2009
Interview
I was contacted by amazon recruiter for phone screen. The first phone screen tooks an hour and I was asked question about some C++ question and algorithm. two days later they come back to me and scheduled a second round phonescreen. The process is same as the first one; and guess I screwed up; 2 days (again) later I was informed via email that I failed :(
Interview questions [1]
Question 1
given 10 mega byte storage, how many UPC bar code you can save in it?
I applied through other source. The process took 1 day. I interviewed at Amazon (Seattle, WA) in Nov 2009
Interview
I was asked a number of technical questions about data structures and big O timings for the algorithms that I used to solve the problems. The interviewer was nice and would lead you in the right direction if you got stuck. It really felt like they wanted to test your knowledge and intelligence. It was a pleasant experience even though i was very nervous.
Interview questions [3]
Question 1
Find the first non-repeating character in a string
I applied through other source. The process took 1 day. I interviewed at Amazon in Nov 2009
Interview
A recruiter contacted me directly after posting resume on multiple online job boards. A technical phone interview was setup for me. The recruiter warned me that it would be a highly technical interview covering such things as algorithms and data structures. This is something I have not used in years so I spent a lot of time preparing for this interview. I was interviewed by a software developer who was very nice.
Interview questions [1]
Question 1
Given the function prototype for a function called secondLargest given a pointer to a list of integers, write down on a piece of paper how you would implement this function and read it back to me. Follow up questions included what is the complexity of your algorithm (O notation)? How would you extend it to do nthLargest element?