J'ai postulé en ligne. Le processus a pris 2 semaines. J'ai passé un entretien chez Amazon (Gainesville, FL) en janv. 2016
Entretien
Applied online for an internship on jan 2016. First its a debuggimg test. Very easy one line debugging. It is a 20 minute debugging test. Then a phone call which ia the final round. Thought mine was good, but got a reject. The phone call lasted for 45 mins. He first asks behavioral questions related to your project, or why amazon. It is followed by a couple of theory questions related to hash tables arrays, linkedlist, etc. Their advantages and when to use them.
Next it is followed by couple of coding questions.
Questions d'entretien [1]
Question 1
Binary search in a circular sorted array. Find difference between two dates. Dynamic programming. Merge two sorted linkedlists.
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.
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.