J'ai postulé via la recommandation d'un employé. J'ai passé un entretien chez Amazon (Londres, Angleterre) en mai 2024
Entretien
I got referred by a friend for few roles in different times and finally got contacted by recruiter. Then had an online assessment which was on technical and leadership questions.
After passing them I had a phone call, it is weird that the question I got was kind of mix of 2 few questions to solve to come up with the right answer and also I have to say it was not from top Amazon questions, it was not typical leetcode question, but question that needs DS and Algo knowledge to solve. I could not finish the solution on time.
Questions d'entretien [1]
Question 1
Question that is not typical leetcode, but needs DS and algo knowledge.
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.
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.