J'ai postulé via un établissement d'enseignement supérieur ou universitaire. J'ai passé un entretien chez Amazon (Seattle, WA) en déc. 2013
Entretien
It was not a normal interview process. This interview was different from the normal ones, it was based on full day project.
In this project recruiters will form a team of 3 or less and they will assign a project which will consist of three parts.
By the EOD you will have to complete all the three modules of the project. While you are working on the project, they will have 30-40min interview with you, where they will ask you questions about the given project like how and what will you implement? and why this module? Data structures and details about it.
Questions d'entretien [1]
Question 1
It was question related to a project we were working on.
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.