Developer 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 Mar 2011
Interview
Had lunch with the employees and they shared some work experience here and talked about what they were doing and what technical they used. Later, there will be 4 rounds 1:1 interviews, each took about 45minutes. They seem payed a lot of emphasize in the design patterns, including 2 design patterns questions in my interviews.
I applied online. The process took 1+ week. I interviewed at Amazon in Jun 2011
Interview
My interview process went like this; I submitted my resume on website and recruiter emailed me 2 days after submitting my resume to schedule a phone interview the following week.
I don't interview over the phone well and should have asked myself these basic questions that I'm sure I use in practice all the time! Anyway - hope the experience helps someone else out!
Interview questions [3]
Question 1
Describe difference between a Set and List - what are different ways of implementing them.
I applied online. The process took 2 weeks. I interviewed at Amazon in Jun 2011
Interview
They asked the questions as below:
1. Why do you want to join Amazon?
2. Which part would you like to join? Front end- Back end or more broader side?
3. Difference between Array and Linked list?
4. Retrieval in an array and a linked list?
5. Insertion in an array and a linked list?
6. What if the array is full?
7. Big 0 of insertion in an array and a linked list?
8. WAP to check whether the string is a palindrome?
9. Take an example and support your answer.
10. Big 0 of the program you made just now.
11. Difference between binary search tree and Hash Table.
12. What will be the big 0 of searching in binary tree and hash table
13. Worst case scenario in Binary Search tree
14. How do you solve collision problems in a Hash Table.
15. WAP using two queues, queue 1 and queue 2 and insert into the stack. The three functions that are allowed to use are: Size(), Enqueue(), and Dequeue.