Status : Final year Btech(CSE) Student, Tier-2 college
Amazon came in my college campus to conduct a placement drive offering a 6 month SDE Internship.

Interview Process::

Round 1 : Online Assessment

There were 4 sections in this test:

• Section 1 : Code debugging section (20 minutes, 7 questions)
  • Problem statement and code were already given, just had to make that code correct logic-wise so that it could pass the given testcases. This was very easy round.
• Section 2 : Coding Test (70 minutes, 2 questions)
  • First problem was this one : https://leetcode.com/problems/maximum-units-on-a-truck/
  • Second problem was based on knapsack problem, classic Dynamic Programming Problem :)
  • I was able to solve both the problems in the given time.
• Section 3: Workstyles assessment(20 minutes)
  • This sections contained so many questions, I cant even remember. This section is a personality test.
• Section 4: Reasoning Ability (35 minutes)
  • I dont exactly remember how many questions this section had, but all were mutiple choice questions. It was pretty easy.

Round 2 : F2F Interview 1

The interviewer was a SDE-II working at Amazon from the past 4.5 years. He was super friendly. He first introduced himself and then asked me to introduce myself. Then, he gave me some instructions, which was basically that there will be 2 problems and only after I gave the solution for the first problem, he would move to second problem.

• First Problem : https://leetcode.com/problems/asteroid-collision/
  • Solved this problem easily using a stack. He was satisfied with the solution that I gave him.
• Second Problem : https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/
  • Solved this problem greedily. He was satisfies with solution that I gave him.

Round 3 : F2F Interview 2

The interviewer was a SDE-III working at Amazon for more than 10 years. He was also very friendly. He started with his introduction and then asked to give my introduction.

• First Problem : He himself made the problem, it was easy problem. The problem statement went like this. You are given two arrays, your array and enemy array. A value at a particular index defined the number of soldiers in that line. You can win a battle if the number of soldiers in that particular line in your array is greater than the number of soldiers in that particular line in enemy array. You can win the war if you can win more than half of the battles. You can arrange your array in any way you want, however you cannot increase/decrease the number of soldiers in a given line i.e. for ex, you have 2 lines, there are 4 soldiers in first line and 10 soliders in second line, you cannot take 2 soldiers from line 2 and add them to line 1, you can only change the position of all soliders in a line. Determine if you can win the war and if you can win, return the arrangement of your soldiers.

  Sample Input-
  	Enemy Array = [60, 20, 10, 100]
  	Your Array = [9,  21, 66, 70]
  	
  	You can rearrange your array like this to win the war
  	Your Array = [70, 66, 21, 9]
  • Solved this problem greedily by sorting both the arrays in ascending order and keeping track of index in the enemy array, I just traversed both the array in a single traversal and kept track the which line of our array is defeating which line of enemy array. He was satisifed with the solution I provided.

• Second Problem : https://leetcode.com/problems/minimum-knight-moves/

  • I solved this problem using bi-directional bfs and he was satisfied the solution I provided.

Compensation offered : https://leetcode.com/discuss/compensation/1494924/amazon-sde-intern-india/1100735

Two days later, an email comes stating that I have been offered a SDE Intern position at Amazon. I was very happy as Amazon was my dream company. I hope that all of your interviews go well and you also get placed in your dream company :)