Envié una solicitud electrónica. El proceso duró 1 día. Acudí a una entrevista en Amazon (Herndon, VA) en oct 2014
Entrevista
The screening was much easier than I expected. The interviewer didn't ask too many difficult questions-just a bunch of general questions on data structures and big O.
He asked me to write some code to reverse the characters in a string and then some code to reverse words in a string. After that, it was just verbal conversation on how I'd go about solving various problems and some resume questions.
I got radio silence after that. Other jobs are still under consideration but I'm doubtful based on the lack of response.
Talked about what they do at their office and the various software they develop to monitor their servers and routers. He mentioned it is interesting if you like to learn about networking or you already know a lot about it. He didn't sound too excited.
Preguntas de entrevista [1]
Pregunta 1
Given a set of billion or more stars, explain how you will find the closest k stars.
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.