I applied online. The process took 1 week. I interviewed at Amazon in Dec 2011
Interview
I was contacted by a recruiter for a position that I applied online. She setup an interview one of the team members from Kindle organisation. He called me at the exact time and asked few question from the resume. With in couple of minute he jumped into technical questions. He asked a question and we need to tell him our initial thoughts about the problem. He ask us to improve the algorithm in terms of time complexity. The discussion goes on inorder to improve the efficiency of algorithm. Then he stops us at a point and asks us to write code in callaboration tool. he will looking at the code we are writing. They dont care about small syntax errors. After couple of days I contacted the recruiter and she said that I was not picked up for an interview. I can understand the reason, I am not that good at algorithms and data structures. So my advice would be going through all the algorithms and datastructures before you apply online. Also I would suggest to work on as many problems as yo u can, so that you can get know multiple ways of solving a problem.
Interview questions [1]
Question 1
How will you check to see if two integer arrays have any common elements?
Interviewed for silicon team. Have only been asked about the domain specific knowledge in 1st round and system design in 2nd round and C coding in 3rd round.
The interviews were 50 mins each.
The phone screen went longer than expected, focusing heavily on implementation details. The interviewer really grilled me on my approach to a Least Recently Used (LRU) cache, asking how I'd combine a hashmap with a doubly linked list. I felt well-prepared since I had gone through system design examples on PracHub, which made me comfortable discussing eviction policies. The later rounds included more technical questions and behavioral interviews, but in the end, I received an offer, though I ultimately decided to decline. Overall, I’d say the process was average, with solid questions.
Interview questions [1]
Question 1
Design and implement a Least Recently Used (LRU) cache supporting get(key) and put(key, value) in O(1) average time. Walk through combining a hashmap with a doubly linked list, eviction policy when capacity is exceeded, and how you'd extend it to handle thread-safe concurrent access.
Recruiter reaches out after applying through Amazon careers, no referral. Had an initial OA, then after a month had four rounds in two days - three coding one system design. Each round had 30 min behavioral and 30 min coding.
Interview questions [1]
Question 1
Questions were mainly hashmap, sliding window and interval related.