I applied through a recruiter. The process took 2 weeks. I interviewed at Amazon (Seattle, WA) in Jan 2011
Interview
Posted resume on a "paid membership" jobs site. I have approx 5 yrs of experience.
Got call from amazon recruiter. Said it was for Amazon wireless. Scheduled phone interview.
I didn't understand why they liked my resume. I was not a Java programmer, but i had a computer science degree. Was totally clueless about what to prepare.
Glassdoor.com helped a LOT! 90% of they questions matched what I saw on glassdoor.
My first phone interview was more OOP questions so I think i did well as I use them daily and was in touch with the topic. The second was more Data structures, I did not do well, as I did not have enough time to prepare in depth.
Be prepared for CS basics like difference between low level and high level languages, hash tables, binary search
Interview questions [4]
Question 1
Compilation diffs b/w c++ and java/c#? Advantages of IL and JIT?
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.