J'ai postulé en ligne. Le processus a pris 4 mois. J'ai passé un entretien chez Amazon (Los Angeles, CA) en juin 2025
Entretien
The interview process consisted of an online coding assessment, followed by several rounds of technical interviews. The questions mainly focused on data structures, algorithms, and system design. In addition to the technical part, interviewers also asked behavioral questions related to Amazon’s Leadership Principles. The overall experience was challenging but fair, and the interviewers were friendly and encouraging.
Questions d'entretien [1]
Question 1
One of the main questions they asked was to solve a coding problem involving arrays and hash maps. I was asked to explain my thought process, optimize the solution, and discuss time and space complexity.
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.