I applied online. The process took 2 weeks. I interviewed at Amazon (Toronto, ON) in Feb 2013
Interview
I applied for some job post on amazon.com career site. And i was contacted to go for my first interview in my university's career center. On that evening, I was told that i will be proceeding to the 2nd round, which is another 3 interviews two days later. All 4 of the interviews are technical based and 45 minutes each. I got an email that they would like to make me an offer the day after the 2nd round.
I applied online. The process took 1 day. I interviewed at Amazon (Belo Horizonte, ) in Jan 2013
Interview
One interview by phone. I thought I've answered all of the questions correctly but did not pass to next phase.
Asked about matrix, memory optimization, complexity...
He asked a lot of questions and in the end, I had to write an algorithm. He hanged up the call and gave me 10 minutes to solve the problem. I could do it in less time and he called me and asked to explain my algorithm.
Since it was an international call, I was not listening the interviewer very well too, but he was incredibly calm and repeated everything patiently.
Interview questions [1]
Question 1
He asked the best way to store boolean values on memory. I said an array but he wanted more, so in the end I said BinaryVector class. He asked why a binary vector is a better option but I couldn't answer that. I told him that I don't know the internal implementation.
I applied through college or university. The process took 2 months. I interviewed at Amazon (Seattle, WA) in Jan 2013
Interview
I applied when they were going to come on campus, but fell sick so could not attend the interview. Later they arranged a phone interview. I had two technical phone interviews - questions were based on data structures and algorithms. Then I went onsite for 4 technical interviews in one day.
1) difference between arraylist and linked list
2) difference between Binary tree and BST
3) complexities
4) Using BST in hashmap for insertion at the time of collision
5) From BST find a number closest to a particular number
Interview questions [2]
Question 1
1) Implement scrabble game - given a scrabbled word the program should return the correct english word. This was supposed to be done using the trie data structure.
2) Roman numbers implementation. Given a number program should return its equivalent roman number. 10 rules for roman number generation were given and I had to incorporate all of them