I applied through a recruiter. The process took 4 weeks. I interviewed at Amazon (Seattle, WA) in Feb 2013
Interview
Applied in January through both recruiter and online. They contacted me within a week to schedule phone interviews, which mostly focused on technical aspects. I was asked a few questions, including comparing between different data structures. I prepared for the interviews by studying linked lists, binary trees, and graph algorithms. I was friendly with the interviewers and they were friendly back to me.
Interview questions [5]
Question 1
How would you implement an Autocomplete feature and what data structures would you use to do so?
Write a class that takes in a window size (n) in its constructor. The only method in the class takes in an integer, adds it into a sequence of numbers with that value, and returns the average of the last n values inserted into the sequence. Do not iterate over the sequence to calculate the average. Couldn't use STL.
For example, if window size (n) is 2:
update(1) returns 1
update(2) returns 1.5
update(3) returns 2.5
update(4) returns 3.5
Given: List<String> getActors(String actorName)
This function takes an actor and returns all the actors they acted with in their career. Use this function to calculate the degrees of separation between one actor to another.
Group input strings by permutations and output as a set. For example, if your input is: "abc, acb, bce, dce, cde" then your output is: "(abc, acb) (bce) (dce, cde)". Assume all input strings are of the same size. Didn't actually have to write the code for this one, but rather gave an in-depth step-by-step explanation using data structures and time and space complexity.
I applied through college or university. The process took 2 weeks. I interviewed at Amazon in Jan 2013
Interview
The call I got was a follow-up from career fair. In the two back to back interviews, I was asked to write code for string reversal, comparison of two binary trees. Then I was asked to design a OO Traffic system. Then there few questions on data structures like hash map, linked lists and I was also asked few questions on my previous projects. After ten days I got the offer.
Interview questions [1]
Question 1
Design of traffic system was little difficult. The interviewer kept finding faults with my ideas.
I applied online. The process took 5 days. I interviewed at Amazon (Seattle, WA) in Feb 2013
Interview
I applied online to all the available software engineer positions in Seattle including the inter ones too. I was contacted by a recruiter in a couple weeks vial email. I was scheduled for two technical phone interviews which were completely technical in nature. First interview only had one big coding problem that took all the time of the interview. The second interview had some smaller problems and the coding problem at the last was not that big too. Overall the interviews were not difficult and tricky in nature and I believe I did really well inn them.
Interview questions [1]
Question 1
Find the longest path that exists between any two nodes inside a binary tree given only the root of that binary tree.