I applied through other source. The process took 2 days. I interviewed at Amazon in Sep 2011
Interview
Amazon contacted me when I updated my resume on Monster. After a call from their recruiter, I was asked for a first technical phone interview. I did not do well in that interview, however I got asked to do a second technical interview in which you are asked programming questions I think I did better but I did not get the job.
Interview questions [3]
Question 1
Define the strategy pattern and when could it be used
How would you implement a priority queue. What is the O analysis of your implementation. How would you store a tree structure. How would you implement a tinyURL service.
given a tree write a function isSymmetrical that would find out if the tree is symmetric or not.
-----
Class Node
{
Node leftChild
Node rightChild;
int value;
}
//Write this method:
boolean isSymmetrical(Node treeRoot) {
Examples:
This is symmetrical
7
/ \
5 5
/ \
9 9
/ \ / \
2 8 8 2
This is not symmetrical (value difference):
7
/ \
5 6
/ \
9 9
/ \ / \
2 8 8 2
This is not symmetrical (structural difference)
7
/ \
5 5
/ \
9 9
/ \ /
2 8 8
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.