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.
J'ai postulé en ligne. Le processus a pris 4 semaines. J'ai passé un entretien chez Amazon (Seattle, WA) en janv. 2016
Entretien
I took an online assessment which was mostly finding small bugs in programs. Next was a 45-1 hour phone interview. Both the online assessment and phone interview were pretty simple. I thought I did pretty well but still I did not get an offer. The interviewer was pretty nice and was helpful on some of the questions.
Questions d'entretien [1]
Question 1
It was all technical questions. First question was to write a fizzbuzz program. Second questions was, given two lists containing names, find the common names in the lists. Third question was, given an array in an ascending order, and given that you know that there is at least one integer missing from the array, determine this number. I was also asked complexity of binary trees. The interviewer was a nice guy. He was so cool.
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.
Questions d'entretien [1]
Question 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.