I applied online. The process took 1 week. I interviewed at Amazon (Seattle, WA) in Feb 2015
Interview
Four rounds technical interview, at the beginning of each round, there will be some question about your project and experience, some behavior question, technique questions are mostly algorithms and object oriented design. Basic questions are not too hard, however, if you finished the question smoothly, the interviwer will ask for some follow ups, if you can't figure it out, you can't get the offer.
Interview questions [2]
Question 1
Given an array and a target value, find two numbers whose sum equals to the target value.
I applied online. The process took 2 months. I interviewed at Amazon in Jan 2015
Interview
I applied online. After that I got an email from the recruiter about an Online Assessment Test. I took the test, it was 20 min and about debugging skills and how to read others code and fix bugs. After that I received an email to move to the second round. I got a phone interview from one of their engineers. The telephone interview was mostly about data structures and algorithms and about my background. After less than a week I received the offer. I signed it and sent it back to them. However, after more than one month they retracted it claiming that Amazon does not apply for export control licenses for candidates from embargoed countries. I was just shocked that it took them this much time to realize that. It is disappointed for them to do that after we went this far with the process. I asked for an exception or placement in a team that does not require export licenses, but there was just no hope. I missed two interesting opportunities because of that.
I applied online. The process took 4 weeks. I interviewed at Amazon (Dallas, TX) in Mar 2015
Interview
i apply on line after three weeks i get a online coding test. it's very easy. i think every cs student can figure it out easily. after more than 2 weeks i ask for update, then i get a phone interview one week after. the interviewer is friendly to talk with. but i screw the interview at last. i stuck in the last algorithm question, and not able to give out a very clear answer.
Interview questions [1]
Question 1
On common phones each digit can be mapped to three or four letters. For instance 2 can be mapped to a, b, or c. Given a phone number represented as an array of integers, return all the possible permutations of strings for that phone number. For example [2, 3] would result in {“ad”, “ae”, “af”, “bd”, “be”, “bf”, “cd”, “ce”, “cf”}.