Me postulé a través de una recomendación de un empleado. El proceso tomó 1 semana. Acudí a una entrevista en Amazon (Pekín, Pekín) en oct 2024
Entrevista
Focusing on Dynamic Programming, the OA part is not that difficult.
1 for the greedy algorithm ( but can be solved with the DP method ).
1 for DP LeetCode 674
The interview process will emphasise problem-solving and industrial-level system design. This part is quite challenging.
Preguntas de entrevista [1]
Pregunta 1
In your crypto quantitive trading system, how can you solve the problem of transaction delay?
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.