I applied online. The process took 4 weeks. I interviewed at Amazon (Seattle, WA) in Apr 2013
Interview
My school is not one of the schools where Amazon recruits from. I started by going to the Amazon jobs site and applying to all the positions that I thought I was a good fit for. A week or two after I filled out my applications, I got an email from an Amazon recruiter inviting me to an on-site group interview (no phone screens prior to this). They flew me to Seattle, put me in a hotel nearby, and we (the other interviewees and myself) participated in an all-day coding exercise. I cannot discuss the problem that they gave us, but once we finished, we were free to leave. Spent the rest of the evening exploring Seattle, flew back home, and am now waiting for a response from them.
I applied online. The process took 4 weeks. I interviewed at Amazon (Seattle, WA) in Dec 2012
Interview
Submitted my resume online on their website and recieved an email from their recruiter to schedule a phone interview. After clearing the first phone interview , second one was schedule , got through it too. I was invited on campus to Seattle for face 2 face interviews. Had five(4 technical + 1 behavioral) 1:1 interviews , did well in 2 , 1 was ok and 2 were bad. They called me after a week and informed me that they want to pursue other candidates. On whole it was really a good experience. Brush up Data Structures and Algorithms. Make sure you're strong as hell in atleast one programming language preferably C++/Java
Interview questions [1]
Question 1
Phone Interviews:
1) Least Common Ancestor of 2 nodes in a binary tree
2) Trim extra spaces in a given String.
3) Check whether given linked list is circular or not
4) Design a restaurant reservation system
Face to Face:
1) System Design question . Implement "File" java class. He went deep in to the design specifics , asked me to design cache , handle parallel access , efficient data structures to do it etc..,
2) Integers are arriving at a rate of one on a socket stream. At any given time print k largest numbers. Describe an efficient algorithm and implement it in language of your choice.
3) Given a binary tree and an integer S , print all distinct paths from root to leaves which sum to S. Describe the algorithm and implement it.
4)Write a program to print the largest sub string which is a palindrome in a given string. He asked me to optimize it with O(n) solution
5) Given a list of nodes , Node class has fields value(of type integer) , next(of type Node) , other(of type Node) where next points to next node and other points to some arbitrary node in the list. Make a copy of the list. Describe an efficient algorithm and implement it.
I applied through a recruiter. The process took 2 weeks. I interviewed at Amazon (Seattle, WA) in Apr 2013
Interview
Phone screen. They contacted me about this position. They did a phone screen asking questions about OOP design and then algorithms and most importantly knowing the Big O notation and complexity issues.
Interview questions [1]
Question 1
How would you create an array given two sorted arrays.