I applied through a recruiter. The process took 1 day. I interviewed at Amazon in Apr 2010
Interview
Got a call from company's recruiter and have a phone interview. The recruiter is very proactive since I originally only get an email and I did not respond to it. Then a week or two later the recruiter called me.
The phone interview is long (around 1hr 15min) The interviewer did not ask many questions on my job but instead ask me several technical questions.
The interviewer is fair but he did not volunteer any hints.
Interview questions [1]
Question 1
Given a binary tree, how do you create a function that can swap the binary tree? (i.e. the left child becomes the right child and vice versa)
From this function you just created, can you create another function that will swap the tree in Alternate level? (i.e. swap 1 level and then the next level does not swap)
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.
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.