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.
I applied through a recruiter. The process took 3 weeks. I interviewed at Amazon (Seattle, WA) in Oct 2013
Interview
Had 1 Phone call from recruiter for intentions checking.
Then got first technical interview over the phone. The asked questions about Java and general complexity of hash table linked list etc'. The asked about Java GC and final, finally and finalize method in Java.
Then got a second interview by phone. It was an algorithmic riddle quite average about calculating minimal Manhattan distance on matrix world to some train stations. The interviewer was arrogant, rude and displayed hostility. He replied to private phone calls during the interview and often cut the continuation of the interview process. I have never witnessed such a bad behaviour from interviewer.
Interview questions [1]
Question 1
If I am available for relocation, Java general questions, algorithmic questions
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.