Amazon internship interview experience (on campus)

Round 1: (1 hour and 20 minutes)

The first round was online test it was conducted in Hacker-rank Environment. It consists of the following sections:

  • Technical aptitude – 20 Questions
  • Coding Question – 2 Questions


  1. Input = {1, 0, 1, 1, 1, 0}

Where 1 represent the student standing and 0 represent the student sitting.

There is only one neighbour for left end and right end student remaining have two neighbours. If the neighbour of the two persons is sitting next time the person became standing. If the neighbour of the two persons is standing next time the person became sitting. The iteration repeats for N number of time.

Output = {0, 1, 0, 1, 1, 1}



I do only one coding question correctly with first output and 20 MCQ Questions.


Round 2 (1 hour 30 miniutes)

Around 15 students were shortlisted for this Round.

x=1, y=2, z=-10

Find the sub-array with the maximum sum such that multiply the x, y, z value with       the sub array and find the maximum sum.

Output : (-10 * 10 + 2 *  40 + 1 * 30) = 10 (Maximum sub array sum).

I do 2 problems with the optimised solution and third problem with brute force solution O(n^3). He wants only the optimised solution. He help me a lot to solve the problem but I can’t able to solve it.

There is one more Technical Round I did not get through the round 🙁 .


The reason for rejection is not well and good in data structures and Algorithm concepts. Please refer the Geekforgeeks ( ) to strong in data structures and algorithm and Time complexity.

Practice all these problem in the following link. ( )

Write your Interview Experience or mail it to

My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using or mail your article to 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.