I applied online. The process took 4 weeks. I interviewed at Amazon
Interview
After submitting my resume, I received an e-mail from their recruiter inviting me to an interview. They were doing interviews at my university on specific days, so I was asked to choose one of those days and specify a time slot that works for me.
At the interview, there were two Amazon engineers in separate rooms and I had to do a 30-minute one-on-one interview with each of them. They weren't notably friendly, but both were very polite and respectful. The interview consisted mostly of technical programming questions - there were probably only 2 or 3 general questions.
Interview questions [1]
Question 1
You have a file with 4 billion integers. Find an integer that doesn't exist in the file, given that you have very little available memory on your computer.
I applied through college or university. The process took 1 day. I interviewed at Amazon (Poona) in Dec 2013
Interview
1 round of Aptitude
2 rounds of Technical Interviews
1 HR Round
Interviewers were friendly and quite encouraging and helpful
If you want to get selected focus on Data structures.
Prepare from Data Structures Made Easy By Karumanchi all questions were from here or similar to ones posted in this book.
I applied through college or university. The process took 2 days. I interviewed at Amazon (Vāranāsi) in Sep 2013
Interview
Amazon written
20 mcq on basics of c,os,networking+ 2 coding (left view,rotate a matrix by 90 degree)
Interview(round-1)
1.you have to find p,q of matrix p*q
such that it fill n elements(n given)
Such that
a) matrix should be nearest to a square matrix and
b) 0<=((p*q)-n)<=2
2. zig-zag traversal of tree
3.you are given an array of length k and it have numbers from 0 to n (where k>>>n) in O(k) time and no extra space find occurrences of each element in O(k) time only
ROUND-2
1. You are given row and column wise sorted matrix you have to find and delete an element such that it is still sorted in O(n) time
2. Find if sum of any 2 elements in an array equal to k in O(n) time using extra space
3.In a bst to every element add sum of elements greater than it.
Interview questions [1]
Question 1
1.you are given an array of length k and it have numbers from 0 to n (where k>>>n) in O(k) time and no extra space find occurrences of each element in O(k) time only
2. You are given row and column wise sorted matrix you have to find and delete an element such that it is still sorted in O(n) time