I applied through college or university. The process took 1 day. I interviewed at Amazon in Feb 2012
Interview
Asked to describe binary search tree
Interview questions [1]
Question 1
given an array of integers(positive or negative), and two integers x, y. write a function that can find a subarray whose sum equals to x and product equals to y
I applied online. The process took 1 day. I interviewed at Amazon in Mar 2012
Interview
I applied through amazon's website and they contact me one month later.
There are two phone interviews and each of them takes about 45 minutes(30 minutes to answer their questions, and the rest is for you to ask them questions). Both of the two interviews are technical and they are all about algorithms, they didn't ask me questions about OO.
Interview questions [1]
Question 1
Find the index of an element in a matrix which has been sorted, if can't find the element return (-1, -1)