I applied through a recruiter. The process took 2 weeks. I interviewed at Amazon
Interview
The technical interview process was totally based on resolving algorithms and logic, LinkedList was one of the topics. You have to write it down on paper and then talk the code back to the interviewer.
Everybody I had the opportunity to interact was very, very nice except for the second technical interviewer, a very arrogant guy who make me very upset.
If you want to move on, buy some books like that "Cracking the Code Interview" and get to the basics of computer science.
Interview questions [1]
Question 1
Unexpected question: my second phone interviewer felt bad when I said that I was good interfacing with clients. He was expecting me to say that I loved some code, or something technical like that. Not that I don't like, I do a lot, but I had to proof that since it was not his first assumption for a Software Developer.
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.