J'ai postulé via la recommandation d'un employé. J'ai passé un entretien chez Amazon en févr. 2013
Entretien
Had two rounds. First round went fine. Was asked a question I was able to solve. Nothing very tricky, but thorough understanding of data structures and algorithms is a must. The second interview was the worst experience ever. The interviewer's english was quite bad, and at times I wasn't even able to understand what she was saying. and i had to ask her to repeat the question over and over again. And I had the feeling she was typing on the other side, probably getting her work done during the interview. Although I was able to get the solution at the end, finally didnt get an offer. Will never interview again here.
Questions d'entretien [1]
Question 1
Find the longest repeated substring in a given string.
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.