Envié una solicitud electrónica. El proceso duró 3 semanas. Acudí a una entrevista en Amazon (Tempe, AZ) en feb 2016
Entrevista
One debugging question online interview and one programming phone interview. Cracking The Coding Interview is very useful and highly recommended for any interview process and plan ahead for any upcoming opportunity. Even with less preparation, just be enough confident for tackling any questions and start the modular approach, like what you need to do and then to do that thing, what different- different small tasks you need to fulfill and how this small tasks combinedly give you your desired result. It is kind of divide and conquer approach but very useful for thinking for any problem.
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.
Preguntas de entrevista [1]
Pregunta 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.