Candidatei-me online. O processo levou 2 semanas. Fui entrevistado pela Amazon (Boston, MA) em jan. de 2014
Entrevista
Applied online. They then contacted me with interview dates that were available. I was in korea at the time so I had to postpone and they were willing to move the dates back. The interview consisted of two 45 minute technical phone interviews. They were not very difficult as far as coding and algorithms go.
Perguntas de entrevista [1]
Pergunta 1
Given two sorted arrays how would you combine them into one sorted array.
Further: Given a list of K sorted arrays of average length N, how would you combine them into one sorted array.
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.
Fiz uma entrevista na empresa Amazon (Toronto, ON).
Entrevista
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.
Perguntas de entrevista [1]
Pergunta 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.