Amazon Interview Experience | On-Campus 2020 for SDE-1

Round 1: Coding round
Online coding assessment consists of 2 sections
MCQs: 28 questions with no negative marking
The questions had code snippets based questions, OOP and OS based questions. C basics should be strong.

Coding: 2 coding questions
They have a pool of about 20 questions from which they give 2 random questions.
1) Dice Throw | DP-30
2) Given a starting and ending time of events and only 1 event can take place at a time, print the maximum number of events that can take place. (Hint: Sort on the basis of start time and take a greedy approach)



Round 2(Face to Face Interview)

I started with a level order traversal approach, then he moved on and asked to do the same with a preorder traversal. I had used a map to store the nodes and then print them after the complete traversal but then he asked me to improve the print operation and for that I used an unordered_map and a min index for the complete traversal. Then he asked me for the changes to make it a bottom view.

He went onto ask a few concepts of Operating Systems like Process, Threads, deadlocks and Scheduling.

Round 3(Face to Face Interview)

He then asked me about the strongest point on my resume and discussed deeply on the topic for about 20 mins.

Round 4(Face to Face Interview)
Given an array of R and C, where R represents a rabbit at that location and C represents a carrot at that location and an integer D, a rabbit can eat a maximum of 1 carrot within the range D. Output the maximum number of carrots that could be eaten.
I gave a solution of O(n+d) but he made me improve it to O(n).

Round 5(Face to Face Interview)

The interviewer helped out a bit though. Asked a few minor things from the resume. He then relaxed the environment and asked about my hobbies.

In all the interviews they started by asking the approach and at the end we had to finally code up the problem.
Result
Converted.

Write your Interview Experience or mail it to contribute@geeksforgeeks.org



My Personal Notes arrow_drop_up

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


Article Tags :
Practice Tags :


1


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.