Intenrship applicants have rated the interview process at Amazon with 3 out of 5 (where 5 is the highest level of difficulty) and assessed their interview experience as 100% positive. To compare, the company-average is 63.8% positive. This is according to Glassdoor user ratings.
Common stages of the interview process at Amazon as a Intenrship according to 1 Glassdoor interviews include:
Skills test: 50%
Phone interview: 50%
Here are the most commonly searched roles for interview reports -
I applied through college or university. I interviewed at Amazon
Interview
The process was pretty basic. 1 hour test having some mcqs and 2 coding questions was conducted. Based on test score 15 students were shortlisted for PI .I was asked a question on algo and then 2-3 questions on data structures.
The process took 2 days. I interviewed at Amazon in Jun 2014
Interview
coding is too much.
and asked me to build objects by myself.
there are too much pressure from 1 to 1 interview.
I can not stand it.
Share your interview experience insights with job seekers so that they can know what to expect from the hiring process.
I applied through college or university. The process took 1 day. I interviewed at Amazon (Jalandhar, Punjab) in Jul 2014
Interview
Written Round:
This round consisted of 20 MCQs and two coding questions. We had to complete the test in 90 minutes. The MCQs mainly focused on C and general aptitude. They were easy to solve. The students having faster question solving skills were in advantage! The two coding questions were:
1. We were given the edges of the graph and we had to find if a cycle exist in the graph or not.
2. Given a binary tree, we had to print all the nodes in the Zigzag order.
Interview questions [1]
Question 1
Face to Face Interview:
The interviewer started with the question about what projects I have done. I explained the two recent projects which I did. Then he started asking technical questions. He asked about:
1. Given a sorted array which has been rotated, we have to find the point of rotation.
I did it in O(n). Then he asked me to write a more optimized code. I then did it in O(log n) using modified binary search.
2. About heaps, maps.
3. About Job Scheduling.
4. Scaling of websites as one of project was an online portal