The process took 2 weeks. I interviewed at Amazon in Mar 2012
Interview
Had 2 technical phone screen, focusing ONLY on algorithms and data structures.
1st Phone interview questions: Print first 'N' prime numbers
Given key-value pairs, sum up the values of same keys and save them in a data structure. What if you want to retain the order of keys entered? For ex: if the user enters
B-1, A-2, C-3, A-1, B-6 the keys must be saved in teh given order B-7,A-3,C-3
2nd Phone interview: Only 1 question - Given 'n' integers, n being very large, print the numbers in a given range. Ex; print all the numbers between 100 and 200. What data structures to use.
I applied through college or university. The process took 3 days. I interviewed at Amazon (Seattle, WA) in Mar 2012
Interview
I had 3 in-person interviews, each with a different rep, and one by phone. One of the interviews focused on OO design and DB design. The second focused on Data structures and the third one on simple coding questions and recursion. This was for a fresh-out-of-college software engineer, so the level of difficulty wasn't so high, certainly nowhere near the legendary insane questions Google or MS are known to ask. I did well on those three interviews, but not so well on the phone one (more coding questions). My impression was that each interviewer then casts a vote, since I was given an offer despite my poor performance on the last interview. I wasn't asked to go to Seattle for interviews.
Interview questions [2]
Question 1
Design (in Object Oriented manner) a restaurant reservation service. No coding necessary beyond class names and method names and rough description of how they work. Then design the SQL database for this system (table names, columns and foreign keys)
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).