Me postulé a través de una facultad o universidad. El proceso tomó más de 1 semana. Acudí a una entrevista en Amazon (Pittsburgh, PA) en nov 2016
Entrevista
The interviewer first introduced the working condition and location choices. Then, we started to work on some problems. The test has three parts, the first two parts are very straightforward, the third part is to solve two programming problems. There was a review in the end.
Preguntas de entrevista [1]
Pregunta 1
They asked how to find the minimum sum of a given binary tree
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.