I applied through college or university. The process took 3 days. I interviewed at Amazon (Hyderabad) in Aug 2012
Interview
First round was a online test held by careercup at the campus. Quetions were typically same as being posted on the sites.
After then there were 4 face to face interview rounds.
Interview rounds are purely Technical. Concern is shown for proper coding.
first interview round : 2 question were asked one from trees and other from semaphore and hash tables combined.
second interview round : this round deals with real life programming.1 program related to graph was asked. 5-6 theortical questions related to networking, computer architecture was asked
third round : 1 programming question related to binary tree was asked.
5-6 theorical question related to DBMS, C , object oriented design.
fourth round: technical and Hr mix. 3 programming question related to stacks, backtracking and nary trees.
Interview questions [2]
Question 1
given a binary search tree with root node r. now a specific node n is changed to root. write a function so that the after modification tree remains binary search tree.
create a data structure for node of a nary tree other than child-sibling node. now a nary tree is given with cb node. convert it into a tree with the nodes defined by you. inorder traverse the tree.
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.
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.
Interview by recuriter, Phone interview over Chime with one easy Leet code problem and 2 behavioral questions. Although the interviewer was very casual at the start of the conversation, it quickly changed into behavioral questions at the start.
Interview questions [1]
Question 1
Encoding optimization algorithm and talk about a project you did recently.