I applied through college or university. The process took 1 day. I interviewed at Amazon in Nov 2011
Interview
It was a on site 1:1 interview with four rounds. The rounds were very logical but I was out of touch with programming. I tried to solve every logic using my algorithm. I don't remember the questions but it every HR was asking different group of questions. I mean one of the HR asked questions about the link list, other about the data structure and so on.
The process took 2 weeks. I interviewed at Amazon (Hyderabad) in Jan 2012
Interview
Online test of 5 coding questions(easy) for screening to 1:1 interview round. I have heard there is phone interview as well for some people. I didn't have phone interview.
There were 5 round of 1:1 interviews in a single day in their office. They were mainly concerned about our coding skills - covering all testcases, etc..
Interview questions [1]
Question 1
Given a string "aaabbbcc", compress it, = "a3b3c2" . Given that output string's length is always smaller than input string, you have do it inplace. No extra space
I applied through college or university. The process took 2 months. I interviewed at Amazon (Seattle, WA) in Feb 2012
Interview
I had two telephonic interviews for about 45 mins each. The focus of the interviews was data structures, algorithms, oo design concepts and basic coding. Once I cleared the telephonic interviews, I was called in for an onsite interview which again focused on the same areas but little more in depth. I had 4 45 min 1:1 technical interviews. I had to work on one problem in each of the rounds. Problems focused on random numbers, trees and problem solving. I had 1 hour of lunch interview with the hiring manager. He explained about the group, work culture. He asked me to talk about my research and asked one technical question at the end. I liked the people. Casual work culture.
Interview questions [2]
Question 1
Given a list of numbers and a rand(0,1) function, which returns a random integer between 0 and 1. Provide an algorithm to randomly sort the given list, based on the output of the rand() function, which should be called once for every number on the list. Code the solution in any language of your choice.
Given a tree(not a binary tree) and 2 nodes on the tree. Give an algorithm to find the least common ancestor of the given nodes. Code the solution in any language of your choice.