The process took 2 weeks. I interviewed at Amazon in Feb 2011
Interview
I had applied online and received an email scheduling my first phone interview within a week. The interviewer was very helpful and kind. As said in the email, the interview was based on data structures and algorithm complexity.
He asked me to write a program based on arrays and binary tree.
1) Write a program to find the largest sum of two consecutive integers in an array?
2)How to find the height of binary tree?
3)Why amazon?
I cleared the first one and my second phone screen is in next week.
My advice is to revise data structures, algorithm complexity and be honest if you dont know any answer. You can give some information closest to the given question.
Be confident :)
Interview questions [1]
Question 1
Write a code to find largest sum of two consecutive integers in an array with syntax and read it aloud?
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.