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 3 semaines. J'ai passé un entretien chez Amazon (Seattle, WA) en août 2011
Entretien
Two phone interviews:
- Writing code and reading it loudly
- Sending you a link which contains an interactive webpage;
Type code on that page so interviewer can see it in real time.
The the second phone interview was one week after the first one.
Each took about 45 min to 1 hour.
Interviewer will follow your answers and track thoughts all the way down!
So be aware any potential flaws in your solutions.
You can also defend your position and give the reasons.
I was invited to have an on-site interview in Seattle. I declined to continue since I had other offers.
Questions d'entretien [2]
Question 1
Using Stack structure only to implement Queue.
How to enqueue, dequeue?
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.