I applied through college or university. The process took 2 days. I interviewed at Amazon (Coimbatore) in Aug 2014
Interview
Totally four rounds
1.Online apti with two programs(1.30hr)
2.Technical interview(45mins)
3.Technical interview(45mins)
4.HR(30mins)
In first round 20 technical apti in ds and c and two programs. First i did the programs because only programs are impart. I done one program.And i selected for next round.
In 2nd technical round they asked two programs. One is finding Kth largest element in BST.
and another one is finding Kth largest element in given no of sorted arrays.
I write a program for first one. And told logic for second one. But i didn't selected for next round.
Interview questions [1]
Question 1
All questions in technical interviews are based in linked list and recursion.
The interviewer straight up asked to solve coding questions and didn't give any time for introductions or discussing about what I'd done. He was typing something on the laptop the whole time and was very slow in responding to questions, he was almost oblivious to the fact that I was sitting in front of him and trying to tell him something. He chucked aside any alternate solutions I gave to him and wanted me to come up with the exact algorithm he wanted.
I applied through college or university. The process took 2 days. I interviewed at Amazon (Warangal) in Jul 2014
Interview
Initially there was a presentation from the HR of Amazon in our college (NIT-W). There he told us about amazon, its vision, its reach and how it works. Then we had an aptitude round having 20 mcqs and 2 coding questions. Out of ~80 students, 8 were shortlisted based on performances in both mcqs and coding questions. After that there were 2 interview rounds. Both were technical rounds.
Interview questions [1]
Question 1
Questions were of average difficulty level. In first round he asked me about hash functions that used in cryptography seeing my resume. Then to find if a preorder of bst stored in linked list is of a skewed tree or not (ie each node should have atmost one child). He told me to solve this in linear time and using constant space. In second round I was asked about LCA. Also to maintain a stack in a way that push(), pop() and get_min() can be done in O(1) time