I applied through college or university. The process took 1 day. I interviewed at Amazon in Feb 2012
Interview
3 interviews of 45 minutes each
- 2 design problems(metro planner and one more)..involved using most efficient data structures(hash map, BST, linked lists),
- merge two BST
- keep versions of a stack most efficiently
The process took 3 weeks. I interviewed at Amazon (Herndon, VA) in Feb 2012
Interview
It was my second phone interview after a first phone interview 3 weeks back and a coding assignment. The interview surprisingly did not have any coding questions (although the first interview had coding). Most of the questions were related to OOPS/Scaling/DNS
Interview questions [3]
Question 1
Describe a project you are working, tell me how would you scale the application to handle large data.
I applied through an employee referral. The process took 6 days. I interviewed at Amazon (Seattle, WA) in Jan 2012
Interview
My friends hand in my resume and I get the on-site interview directly.
The interview process is basical, first have a lunch with several amazon employee. Then each candidate was brought to the room and start the interview. I had four interviews in total, and I did perfectly in the first one, the second one and the last one. I think they fail me because I didnt do well in the third one. So, just bear in mind that Amazon is very picky, if you screw up one of the four interviews, then you fail.
Interview questions [4]
Question 1
How to save a dictionary.
Easy one, just use a trie. During the process, you will be asked questions about big O stuffs. Just remember your data structure
How to find every word in one paragraph and return back the 10 most frequently words.
Easy one again. Use a hashtable to store the words, after that, use a heap to return the 10 most
Numerical Roman numbers.
I screw up this one. That's because the interviewee gave me a sheet full of rules, but only two of them are useful in the first part.
First part: given a formatted Roman String and convert them into numbers.
Easy one, but I spend nearly 25 mins on it.
Second part: how to convert a number into Roman Strings.
Recursion will work. I only have ten mins, so the interviewee doesnt let me finish this up
You have a node, each have three fields: value, next and random. How to make a deep copy.
The interviewee is helpful, he gave me hints and I finally solve it. First copy the list with only value and next. Save each one in the hashtable. And then change the random value.