I applied through college or university. The process took 1 day. I interviewed at Amazon (Allahabad) in Jul 2014
Interview
It was an on-campus recruitment process. There were two sections in first round which was conducted online. First section had 20 mcq questions from c, c++, os and dbms, toc, dicrete maths etc.
After this round 21 students were selected and i was one of them.
First round was technical interview round. interviewer called me and he started asking questions to me. The first questions was- You are given a string without spaces and a dictionary which validate whether a word is valid or not. You have to convert the string into a sentence with spaces with all words valid in it. eg. ireadnewspaperdaily, now you have to convert it to i read newspaper daily.
i told him the idea by taking the letters of string one by one as a string and checking whether the word is valid or not. then he asked me to write the code.
2nd question- you are given a array of string with repeatition of strings. you have to print the non- repeating strings. I Describe him the idea of finding the non repeating string in O(n^2) compllexity. then he asked me to optimise it further.
after some time the results of first round was declared and i was not selected for 2nd round.
after this round 8 students were selected out of them 5 was hired for intern.
Interview questions [1]
Question 1
modified version of word break problem with printing the string.
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.