Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

Amazon Interview Experience | Set 203 (On-Campus for SDE-1)

  • Difficulty Level : Expert
  • Last Updated : 01 Jul, 2019

Hi everyone. Following is my experience of the recent Amazon recruit drive:

Aptitude Round: (1:30 hours)
20 MCQs
MCQs on outputs, maths, algorithms, DBMS, OS.
2 Coding questions: ( on hackerRank)

Become a success story instead of just reading about them. Prepare for coding interviews at Amazon and other top product-based companies with our Amazon Test Series. Includes topic-wise practice questions on all important DSA topics along with 10 practice contests of 2 hours each. Designed by industry experts that will surely help you practice and sharpen your programming skills. Wait no more, start your preparation today!

Tip: It is important that one should attempt both sections decently.


Round 1:

  • On a number line from negative infinite to positive infinite, if you start from 0, you can either jump back or front. but every jump length is 1 more than the previous jump. Given a number on the number line, can we reach it using any combination of jumps. If yes, print the minimum length path.
  • Boolean Matrix Problem
  • Row with max 1s

Round 2:

  • You have n slabs with two dimensions. Stack them to get max height. No rotation of dimensions required. First he started with 2 dimensions, then 3, 4 and then for n dimensions.
  • Given a binary tree, a target node in the binary tree, and an integer value k, delete all the nodes that are at distance k from the given target node. No parent pointers are available.

Round 3:

Round 4:

  • Implement the power function in log n complexity.
  • Intersection of two arrays
  • Given a stream of As and Bs, print 1 when no of As is odd and no of Bs is even. I just had to draw the DFA for it.
  • An SQL query.

Round 5:


  • The interviewers are really very helpful and they keep on giving hints if you are stuck. Just let them continuously know your thought process. It is not necessary that you speak continuously but let them know what you think in intervals.
  • They might ask you to think of better complexities and different data structures to solve the same problem. But its not that if you straight away land up in an optimized solution its bad for you because I was asked sometimes to compromise on the complexity but think of other data structures to solve it.
  • While coding take your time. Make sure you cover the corner cases and if it is taking long, let your interviewer know what you are doing currently. Test it before finally approving it. If it fails, don’t worry, tell your interviewer about it and think of a fix or an alternative

    Finally, a big big thanks to GeeksForGeeks for being a wonderful resource.

    If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to See your article appearing on the GeeksforGeeks main page and help other Geeks.

    My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!