I applied through college or university. The process took 3 days. I interviewed at Amazon in Jun 2010
Interview
i first got an email from the university senior relations manager. then there was a follow up from one of the co-ordinators asking me for a tentative interview date for a phone screen. I gave them a date and had questions about algorithms and data structures. Algorithms parts consisted of most of the common problems seen in cormen.
The process took 2 weeks. I interviewed at Amazon in Jun 2010
Interview
The interviews consisted of 2 technical phone interviews. I was contacted first by a recruiter who called me to set up a phone screen because I missed his emails. Everybody seemed to know their stuff and were fairly nice. Both phone screens were similar in that they asked general questions about my experience based on my resume and then dived into OOP design questions and one or two algorithm questions. I was asked this question in the first interview: Given an immutable singly linked list of some object with pointer to next element, find the nth element from the end of the linked list.
Interview questions [1]
Question 1
Given an immutable singly linked list of some object with pointer to next element, find the nth element from the end of the linked list.
I applied online. The process took 2 weeks. I interviewed at Amazon in Jun 2010
Interview
I had two telephonic interviews. In first we discussed my resume and job ex.
Write a C function to find Fibonacci series of n? And discussed its complexities.
In 2nd telephonic interview question:
Data modeling for class-student relationship
Write C function to find recursive last nth element in link list?