I applied through an employee referral. The process took 1 day. I interviewed at Amazon (Seattle, WA) in Jul 2011
Interview
The interview was with the development team and it consisted of 45 minutes of 4 back to back rounds of white board coding with 5 minutes break in between each rounds. Before the interview we had lunch with the team. Then I was taken to a presentation room where I had all the interviews. They said me that I could code in whatever language I was comfortable with.
Performed well in all but one. Waiting for the result.
Interview questions [4]
Question 1
The first interviewer asked me to code a program to evaluate a post fix expression.
Second one asked me to design a Conway's Game of Life. (I had no idea what it was. The interviewer took 5 minutes to explain the game and then asked me to design and code).
In the next round, the interviewer gave me a binary tree and asked me to write all the data in a file and when the file is read back we should be able to construct the original binary tree.
I applied through a recruiter. The process took 1 day. I interviewed at Amazon in Jul 2011
Interview
recruiter found me via linked in.
Four people interviewed me. Asked me to implement several problems. They were medium to difficult one..
I choked on couple although later on I found them to be easy..
Here are some typical questions:
1) pow function that can be generalized to all data types
2) all possible range for alphanumeric zip codes
3) code exam
4) object oriented programming concepts
Interview questions [2]
Question 1
how do you find ancestors on a doubly linked tree ?
I applied through a recruiter. The process took 1 day. I interviewed at Amazon in Jul 2011
Interview
Write a function that takes a BinaryTree and validates if it is a valid BinarySearchTree. Assume the tree contains no duplicate values.
(I couldn't solve it right) Make sure to study hard.
Interview questions [1]
Question 1
Write a function that takes a BinaryTree and validates if it is a valid BinarySearchTree. Assume the tree contains no duplicate values.