J'ai postulé en ligne. Le processus a pris 2 mois. J'ai passé un entretien chez Amazon (Seattle, WA)
Entretien
“I went through an online assessment that focused on coding exercises and data structures. After that, I had a phone interview that included both technical questions and Amazon Leadership Principles. Finally, I attended a virtual onsite loop with four separate interviews: two on algorithms/coding, one system design session, and one behavioral interview heavily emphasizing examples of ownership and dealing with ambiguity. The entire process took about three weeks, and each interviewer was friendly but thorough.
Questions d'entretien [1]
Question 1
Tell me about a time you dealt with a difficult technical problem where the requirements kept changing
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.