Amazon On-Campus Hiring : 2019
Round-1 (Online coding round):
It was 90 minutes long coding round on mettl test. It consisted of 2 coding questions and 28 MCQs. coding questions were easy to medium category. First question was to change one string into another with some modification (pretty much implementation question). In second question, you are given a string containing only 0 to 9 and you have to return string number modulo 11. Around 60 people were selected for further rounds.
Suggestion: If you use c or c++ then please revise your pointer concepts because function inputs and return type are pointers on mettl. Also revise static and dynamic memory allocation because if you don’t allocate memory using new or malloc then your return pointer will point to NULL (many people got stuck ).
Round-2 (Face-to-face interview-1):
The Interviewer was very nice and calm. He started with asking me to introduce myself.
Q1. You are given two linked lists. Every node contains a digit between 0 to 9. You have to make new linked list that contains sum of both linked lists. Also you can not modify given linked lists.
input1 – head->7->9->NULL.
input2 – head->3->6->2->NULL.
Q2. Hotel XYZ wants to conduct N meetings on particular day. You are given start time and end time for each meetings. You have to return minimum numbers of rooms required in XYZ hotel.
input – N : 6, meetings timing – [9:00, 9:45], [9:30, 10:30], [10:40, 12:00], [11:00, 13:00], [11:45, 14:00], [16:00, 17:00]
output – 3 rooms required.
He asked me to write down proper code for above questions. He tested it with some edge test cases. Then he asked me about different sorting techniques and questions like “for which cases quick sort runs O(n^2)”. This round lasted for an hour.
Round-3 (Face-to-face interview-2):
The interviewer started with asking about myself and then moved to projects that I have done. After some questions on projects, he started with the data-structure questions. I have to write proper code for both questions.
Q1. You are given a binary tree. You have to print it’s outer border anti-clockwise.
Q2. You have given N x M matrix. each element in matrix is either 0, 1 or 2. ‘0’ digit means that place is initially empty. ‘1’ digit means that place contains “good” mango. ‘2’ digit means that place contains “bad” mango. In one day iteration, “good” mango which is adjacent (up, down, left, right) to any “bad” mango will become “bad” mango. You start from first day and you have to find the minimum day when there will be no “good” mango or output -1 if it is impossible.
I took too much time in first question. So, I did not come up with optimized solution for second question and had to give brute force one. This round lasted for 45 minutes.
Round-4 (Face-to-face interview-3):
I feel like this was the most difficult round for me but i got solution within some minutes.
Q. URL requests are coming in some server. Now you have to design some type of data-structure such that at any point of time you can return top 100 frequently coming URLs.
I came up with solution using hashmap and heap. But I am not allowed to use STL so i have to write implementation for hashmap and heap. Then he asked me some questions about OS, OOPs, and DBMS. This round lasted for an hour.
Round-5 (Face-to-face interview-4):
This was the last round. The person interviewing me was looking like some senior developer. He stared with asking me about my area of interests, projects I have done, etc. Then after some time he started DP question.
Q1. You have given rod of length n and array containing rod length and price. Now you have to return maximum price by cutting rod optimally.
Q2. You have given an array. You have to find next maximum for every index. -1 if there is no next maximum in array.
Then he started asking about OS questions like difference between process and thread, what is thrashing, what is process table and how it is used, different kinds of CPU scheduling algorithms, what are indexs (DBMS) and why and where they are used, mutex vs semaphors, etc. Then he asked me two SQL queries. This round lasted for more than an hour.
After one and half days of process, I was selected for the Amazon Winter Internship.
- UHG Interview Experience | OnCampus- 2019
- MathWorks Interview Experience (EDG, Oncampus)
- ServiceNow Interview Experience Oncampus
- InfoEdge Interview Experience | OnCampus-2019
- Amazon Interview Experience | Set 167 (SDE I for 1 year 6 months experience)
- Amazon Interview Experience | Set 243 (2.5 Years Experience)
- Amazon Interview Experience | 401 (3+Years Experience for SDE II)
- Amazon Interview Experience | Set 391 (SDE-2, 5.5 years Experience)
- Amazon Interview Experience | Set 241 (1.5 years experience)
- Amazon Interview Experience | Set 242 (1 Year Experience)
- Amazon Interview Experience | Set 248 (4.8 Yrs Experience for SDE II)
- Amazon Interview Experience (For Experience - 2.8 yrs) | SDE 1
- Amazon Interview Experience | 192
- Amazon Interview Experience | Set 244 (For SDE-1)
- Amazon Interview Experience | Set 234 (For SDE-II)
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. 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.