Ho presentato la mia candidatura tramite l'università. Ho sostenuto un colloquio presso Amazon nel mese di feb 2014
Colloquio
On campus interview, 90 minutes in total.
1. An image consists of black white pixels. Count the number of shapes made up by all black pixels. The method is DFS.
2. Two sum problem, but the array is unsorted. The best way is to use a HashMap.
3. Find the kth largest node in an unsorted linked list. The algorithm is called quickselect.
4. Object - oriented design question. Design a calendar.
Domande di colloquio [1]
Domanda 1
Before the interview, I thought the questions should be very easy because it was only an internship interview. However, obviously I was wrong and didn't perform well in the interview. Be prepared!
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.