I applied through college or university. The process took 3 weeks. I interviewed at Amazon
Interview
I applied through on campus process. I submitted my resume' , after about 3 months when I thought I failed, I received a phone call from Amazon's recruiter to schedule first round interview. The first round interview had 2 back to back 30-minutes interviews. I heard about the result few days afterward for the final round. The final round was another back-to-back 45-minutes interviews. This went well. And about 1 week later I heard about the offer
Interview questions [1]
Question 1
Why Amazon?
How to gain trust from others?
Tell a time when you handle conflict
I applied online. I interviewed at Amazon in Jan 2016
Interview
The first round there was two parts, one where you had to debug some code and one critical thinking section. The second round contained two basic coding questions and general questions about personality.
I applied through college or university. The process took 2 days. I interviewed at Amazon in Jul 2016
Interview
Online Round (1 hr 30 min): 20 MCQs and 2 coding questions using Hackerrank platform
MCQs : There were 20 MCQs based on DS, OS, IQ and output questions
Coding questions:
Round 2: First Technical intervew (1:1)
This was about 45 minutes long.
Round 3: Seond Technial review (1:1)
Also about 45-60 minutes long.
Interviewers are really friendly and encouraging. They help out with hints and check if there is clear understanding of concepts. They have no right answer to any questions, they only check method of arriving at the answer. Questions are very similar to past ones that can be found on Geeksforgeeks.com archives.
Technical Round 1: Puzzle (5-10 minutes)
A man wants to cross a river that is m meters wide. There are stones at random integer distances that he can hop forward with. If the man jumps x meters, his next jump can only be x+1 meters or x-1 meters, and he may or may not find a stone to land on. He starts by jumping 1 meter. How can we know if the man crosses the river?
Technical round 2: There is a network of cities. Some cities belong to state A, some to state B. A man wants to go from state A to state B. How can we find the shortest path (any city from A->B).(1 hour)