I applied through a recruiter. I interviewed at Amazon (Berlín)
Interview
The first part was the Amazon Leadership Principles question. Then, there was a Leetcode Medium question. First, I solved the question in suboptimal way and we discussed the time and space complexity. The interviewer was helpful and kept giving hints to solve the issue optimally.
Interview questions [2]
Question 1
The LP question was something like: tell about the situation, when you had to deal with very time-constraint project/task.
Design a data structure that tracks visitors in a queue with the following requirements:
- Possibility to return the last person in the queue, who visited only once
- All operations must be O(1) time complexity
visit("Alice") -> Queue: [Alice]
visit("Bob") -> Queue: [Alice, Bob]
visit("Charlie") -> Queue: [Alice, Bob, Charlie]
visit("Bob") -> Queue: [Alice, Charlie] (Bob removed because second visit)
get_last_unique() -> Returns "Charlie"
visit("David") -> Queue: [Alice, Charlie, David]
visit("Charlie") -> Queue: [Alice, David] (Charlie removed because second visit)
get_last_unique() -> Returns "David"
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.
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.
Interview questions [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.
Recruiter reaches out after applying through Amazon careers, no referral. Had an initial OA, then after a month had four rounds in two days - three coding one system design. Each round had 30 min behavioral and 30 min coding.
Interview questions [1]
Question 1
Questions were mainly hashmap, sliding window and interval related.