Round 1: Online Test, it was the first round with 4 sections.
Code Debugging test
2 coding questions(70 min)
Something which I observed and pointed out in round one was, the solution must be most optimized in the coding round and as questions were not with a higher difficulty level, thus must have been solved in lesser time. In my case, I finished the test half an hour before the allotted time.
Round 2 (Technical Interview 60 min): First, the interviewer asked to introduce myself. Then he asked about the projects I did. After an introductory discussion on projects, he gave me 2 coding questions on their personal live code environment.
He asked me to explain the approach first and then code it down. I had to explain the time complexity of each solution and optimal code if possible with lesser time complexity.
- Given an array, make in-place replacement such that every element is replaced by its greatest element in right.
- An array with multiple characters(may have more than one occurrences) given with a value K. Makes the minimum number of replacements in the array such that in the resultant array we have only K distinct characters(This question was asked as a word problem with some given conditions.)
Round 3 (Technical Interview 120 min): Similar to the first round there was a brief introduction from both sides. This round was coding plus the kind of HR. After 2 coding questions, I was asked to describe a tough situation which I faced while completing any project of mine, what was my target, what I did to overcome it, and what was the end result.
- A sequence is given as [ T T T T B B B B B B B B B B B T T ] where T denoted the number of TVs bikes and B denoted Bajaj bikes. Write code to count the number of Bajaj bikes in the garage in the most optimal way.
I solved it in O(log n) using binary search.
The second question was typical to understand. And I initially thought that I won’t be able to solve it. But the interviewer was very friendly and cooperative. And he made me reach towards the answer with an optimized solution. I was asked to write a complete working function for this one.
- You are given a bulk of data of 10Mbs and you have a 1Mb RAM available with you. How would you sort the complete 10 Mb of data using this RAM?
The first approach I explained it using merge sort. But it was not that optimized. I was also asked to explain the complexity of each function of the merge sort in every pass. This was something like merging N arrays.
At last, I gave a solution using heap with lesser time complexity, and the interviewer was satisfied by it in last.
15 students were selected among 38 in the interview rounds and I was one of them.
- Amazon Interview Experience (On-Campus) for SDE1 FTE/6M Intern
- MathWorks Interview Experience (EDG, Oncampus)
- ServiceNow Interview Experience Oncampus
- UHG Interview Experience | OnCampus- 2019
- InfoEdge Interview Experience | OnCampus-2019
- Amazon Interview Experience | Set 185 (For SDE1)
- Amazon interview Experience | Set 141 (For SDE1)
- Amazon Interview Experience | Set 150 (SDE1 for 1 Year Experienced)
- Amazon Interview Experience | Set 153 (For SDE1)
- Amazon Interview Experience | Set 184 (Off Campus for SDE1)
- Amazon Interview Experience | Set 186 (For SDE1)
- Amazon Interview Experience | Set 187 (For SDE1)
- Amazon Interview Experience | Set 188 (For SDE1)
- Amazon Interview Experience | 198 (For SDE1)
- Amazon Interview Experience | Set 213 (Off-Campus for SDE1)
- Amazon Interview Experience | Set 254 (Off-Campus for SDE1)
- Amazon Interview Experience | Set 256 (Written Test for SDE1)
- Amazon Interview Experience | Set 258 (For SDE1)
- Amazon Interview Experience | Set 259 (1 Yr Experienced for SDE1)
- Amazon Interview Experience | Set 261 (For SDE1)
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.