J'ai postulé en ligne. Le processus a pris 3 mois. J'ai passé un entretien chez Amazon en oct. 2011
Entretien
I had three phone interviews with Amazon that spanned from late September to late October. The questions were not hard but like other postings have already said doing it over the phone made it somewhat difficult. I was never asked any conceptual questions in any of the interviews rather each interview was one or two problems to be solved. Overall every interview I had was pleasant the interviewer would drop hints to lead you in the right direction or ask if this was the best solution.
From the delay after the third interview I figured the interview process was not going to go further but three weeks seemed like a while to send out a rejection letter. There was a good week or two between each phone interview so it would seem Amazon was doing a lot of interviewing during this period.
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.