I applied through college or university. The process took 3 weeks. I interviewed at Amazon in Feb 2013
Interview
There were two interviews, both with actual software engineers at Amazon. The first one wasn't too scary; the interviewer even asked which topic of data structures I felt most comfortable with. And so he asked a question in that area. Normally, they ask 2-3 questions in one interview, but I only got through one question. The second interview was a little tougher, and it was an actual coding problem which I had to complete on a blackboard,
Definitely know your Data Structures, and go over those Acing Programming Interview books.
Interview questions [1]
Question 1
It was a specific sorting question about sorting certain chunks in an array. I had to write it out and then the efficiency of the program was asked as well.
I applied online. The process took 1 week. I interviewed at Amazon in Mar 2013
Interview
2 independent phone interviews
Interview 1: Started the interview asking me about the most challenging problem I have solved(technically) in the recent past. Define graphs, trees, BTrees, BSTrees etc. Applications of each of these. Questions like "Which data structure would you use when...". Questions based on multi-threading in java, questions on how Hash maps work internally, concurrent hash maps and hash tables.
Coding question: Check if two binary trees are equal. I did it recursively, he asked me do it iteratively. Complexity and all that.
Interview 2: This interview also started with the most challenging problem I have solved(technically) in the recent past. Then asked me to WAP to find the Nth Fib number(I was bewildered! Amazon, really?) Wrote the iterative version of the first ever program I learnt in my life. Asked me why I am not doing it recursively(was more than happy to answer.) He then asked me to find the nth prime in the least number of iterations(used the square root rule for reducing the number of comparisons). He tweaked around the same question like what would you do if want to find primes between two numbers. Complexity and all that. Given a set of billion numbers, how would you pick the biggest million numbers? When do u use hashes and how different is it from encryption? (Oh yea!). Some basic questions on patterns.
OOPS question- Design a Zoo
Suggestions: All they look for is how you can explain things in the easiest way. Before starting to code, ask him as many questions as you can(Like what complexity you looking at? Space? Iterative or recursive? Should the function return anything at all?). This is how functions looked in the first interview.
Contract: Tree Tree -> Boolean
Description: This function takes two Binary trees and checks for equality
Example:
1 1 -> True
2 3 2 3
2 2 -> False
3 4 3 5
Strategy: General recursion
Function definition:
public boolean areThetEqual(Tree t1, Tree t2){
...
}
Tests:
Check all boundary cases.
---------------------------------------------------------------------------------------------------------------
When it's your turn to ask him questions, ask him some really relevant questions. If you make the interviewer think, you have done you job.
Hope this helps a little. All the very best.
I applied online. The process took 5 weeks. I interviewed at Amazon (Bengaluru) in Jan 2011
Interview
2 phone screens. 5-8 face to face interviews.
Sometimes the recruiters screen you 1st on phone before everything else. Be careful if your recruiter starts interviewing you. They tend to note each and everything aspect of your behaviour and conversation and help steer hiring decisions, either ways. The company is about high hiring standards, and recruiters seem true disciples of that... I've heard that when a recruiter says "no" to hire, no one questions them
Interview questions [1]
Question 1
Behavioural. Sometimes if enough time is given to think through past experience, this would mostly be cake walk, be sure to check the leadership principles before you walk in for an interview!