first had a coding round that tested my problem-solving skills and knowledge of algorithms. After that, I went through three interviews, which were a mix of technical and behavioral questions. Each interviewer focused on different aspects, like system design, data structures, and cultural fit. I had to explain my thought process clearly, solve real-world problems, and demonstrate my understanding of key concepts. The entire experience was challenging yet rewarding, and it gave me valuable insights into Amazon's expectations.
Perguntas de entrevista [1]
Pergunta 1
Aggressive cows
Longest Palindromic Subsequence
Matrix Diagonal Sum Calculation
Sliding Window Maximum Problem
Word Ladder Transformation
Graph Connectivity Check
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.
Fiz uma entrevista na empresa Amazon (Toronto, ON).
Entrevista
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.
Perguntas de entrevista [1]
Pergunta 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.