Amazon Interview Experience for SDE-1 (On-Campus)

There was an online assessment followed by three technical interviews. The Technical interviews were of a NON-ELIMa NATION type(Everyone was required to give all 3 Technical interviews, irrespective of their performance in each round).

ONLINE ASSESSMENT:

2 DSA questions were asked of easy difficulty level which we had to solve in 70 minutes. Also, there were around 70-80 behavioral questions to be attempted in around 3 hours time. There was no such specific criteria for shortlisting in this round. 105 candidates advanced to the Technical Interviews.

TECHNICAL ROUND 1 :

The interview started with a brief introduction of mine, followed by 2 DSA questions of easy-medium level.

• Question 1 – https://www.geeksforgeeks.org/given-a-sequence-of-words-print-all-anagrams-together/. Initially, I had a bit of trouble but finally, I was able to solve the problem efficiently.
• Question 2 – https://www.geeksforgeeks.org/find-largest-subtree-sum-tree/. This was a medium-level question for which basic knowledge of DFS was required and hence I was able to do it quite easily.

Then the interviewer asked a few behavioral questions and some questions from my projects which were quite easy to tackle.

TECHNICAL ROUND 2:

The interview started with a brief introduction of mine, followed by some questions about my project and the challenges I faced during it. Then 2 DSA questions of medium and hard levels were asked.

• Question 1 – https://www.geeksforgeeks.org/maximum-sum-such-that-no-two-elements-are-adjacent/. The good thing was that I solved it in O(1) space and the interviewer was quite satisfied with my approach.
• Question 2 – https://www.geeksforgeeks.org/distribute-candies-in-a-binary-tree/. I solved this question by discussing a few examples with an interview to which he was quite satisfied.

This was followed by some questions related to my project including some CS fundamentals which were very easy.

TECHNICAL ROUND 3:

I was expecting more of an HR round but this was also a Technical round. The interviewer asked 3 DSA questions of easy and hard levels respectively.

• Question 1 – https://www.geeksforgeeks.org/problems/the-celebrity-problem/1. This is an easy-level question of hashing which I comfortably solved in O(n) time and space.
• Question 2 – https://www.geeksforgeeks.org/lexicographically-next-permutation-in-cpp/. This question can be solved in O(n) space but I used only O(1) space which brought the attention of the interviewer.
• Question 3 – https://www.geeksforgeeks.org/print-right-view-binary-tree-2/ In this question, I immediately told the approach to the interviewer, so she did not ask me to write the code for the same. This was followed by some behavioral questions and a brief discussion of my projects.