Ho presentato la mia candidatura tramite un selezionatore. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso Amazon (Seattle, WA) nel mese di mar 2012
Colloquio
2 rounds of phone screens (mostly technical questions). Then onsite with 5 45-minute sessions. Each session is one on one (or with shadow), mostly doing whiteboard coding. One of them should be "bar-raiser" interview, but I can hardly tell which one it is. Lunch discussion does not talk about technical stuff, but can still be a hiring manager interview (mostly behavioral questions). Recruiter coordinated everything, can be slow and I had to probe them for status update.
Domande di colloquio [1]
Domanda 1
Some technical problems and some behavioral questions - mostly probing your way of working and cultural fit
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.
Ho sostenuto un colloquio presso Amazon (Toronto, ON)
Colloquio
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.
Domande di colloquio [1]
Domanda 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.