Ho presentato la mia candidatura online. La procedura ha richiesto 3 giorni. Ho sostenuto un colloquio presso Amazon (Sunnyvale, CA) nel mese di dic 2015
Colloquio
I have an one hour phone interview yesterday. The first 30 mins, we mainly to talked about my project, how is the database design. There is only one coding question at the last 30 mins. The question is:
There are many conference room at Amazon, your manager wants you to book a conference room for a meeting. The number of people and time is given. Please return a list of rooms which are available at that time and have enough capacity.
Domande di colloquio [1]
Domanda 1
There are many conference room at Amazon, your manager want you to book a conference room for a meeting. The number of people and time is given. Please return a list of rooms which are available at that time and have enough capacity.
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.
Ho sostenuto un colloquio presso Amazon (Toronto, ON)
Colloquio
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.
Domande di colloquio [1]
Domanda 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.