I applied online. The process took 1 day. I interviewed at Amazon in Mar 2012
Interview
Received a phone call on time. First, talk about my project and what is the most challenging part in my project.
Second, talk about Binary Search Tree, write code on shared document to implement a function which determine whether two BSTs contain same node value(equality). Third, if we need to check equality of BST frequently, how to deal with it. In best case we can check equality in O(1).
I applied through a recruiter. The process took 6 weeks. I interviewed at Amazon (Seattle, WA) in Mar 2011
Interview
I was contacted by a recruiter based on my LinkedIn profile who set me up for a phone interview. There were 2 rounds of phone interviews after which I was invited to their Seattle office for an onsite. Recruiters and HR staff were very prompt about letting me know the results of my interviews. After the initial interview, I was notified within 24 hours of their interest in moving forward.
The onsite consisted of five 1:1 interviews including lunch with the manager. The manager asked me an interview question while eating lunch which was not the most pleasant experience. It was obvious he was ambitious and driven but did not have the best social skills. Some interviewers were friendly and encouraging while others were not.
Interview questions [3]
Question 1
Describe an algorithm to find pythagorean triplets given an array of n integers.
Assume you are given 2 words, an initial word and destination word, (valid based on the English dictionary) containing the same number of letters. You are allowed to only change 1 letter at a time. Describe a an algorithm to find the shortest path (shortest number of letter changes) to get from the initial word to the destination word.