I applied through a recruiter. The process took 1 day. I interviewed at Amazon in Jul 2009
Interview
Interview consisted of Coding test, Data Structure and Algorithm round, problem solving round, a bar raiser round and a discussion with human resource executive. The process took almost twelve hours to finish on a sunny Saturday in Bangalore.
Interview questions [1]
Question 1
Deep probing on object oriented programming skills.
The process took 1 day. I interviewed at Amazon (Seattle, WA) in Dec 2011
Interview
I was offered to interview on campus without a phone screen, flight and hotel paid for. The process consisted of several 45-min 1:1 technical interviews, and the questions were not incredibly difficult (mainly dealing with data structures and algorithms). However, it felt like some of the interviewers were expecting very specific answers and couldn't understand my thought process (when it didn't match theirs exactly). Half of the interviewers seemed tired and not that happy to be there, one walked into the room with an attitude and stayed that way throughout the whole time. Overall, it wasn't a very good experience and did not show off the company in a good light, (as far as software engineering department goes at least).
Interview questions [2]
Question 1
Given sequences of page visits for thousands of users, find the most common sub-sequence across all of them. And now can you do it faster than what you just did. What about even faster.
Give an overall object-oriented design of the game chess. (This was one of the easier questions, but the interviewer was incredibly stubborn in pushing for a very specific answer).
I applied through a recruiter. The process took 2 months. I interviewed at Amazon in Nov 2011
Interview
So far had two phone interviews. Both interviews were on the same day.
First Interview:
1. General OOP questions.
2. Find nth last element in a single linked list.
3. pow(m,n). Asked to code this. Need to handle overflow cases.
Second Interview:
1. Design question: Parking Lot
2. Find all non- duplicate pairs that sum to n.