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.
Questions d'entretien Software Engineer chez Amazon | Glassdoor
Entretien moyen
Candidature
J'ai postulé via une autre source. Le processus a pris 2 jours. J'ai passé un entretien chez Amazon en sept. 2011
Entretien
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.
Questions d'entretien [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
First round with hr screening - 2 leetcode questions then hr manager screening then the loop which consists of 4 interviews each an hour long. The 4 interview questions they asked where three medium leetcode questions. And one system design interview question about how to shadow deploy a test software to millions of users.
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.
Questions d'entretien [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.