Round 1: DS
Implement a hit counter. Aim is to get number of hits in last 5 minutes and 10 minutes. Duplicate hits can also come at a particular time instance.
GFG Link: https://www.geeksforgeeks.org/design-a-hit-counter/
Given an unsorted array of non-negative integers and a sum value, find the subarray whose sum of elements is equal to given sum.
GFG Link: https://www.geeksforgeeks.org/find-subarray-with-given-sum/
The question was further extended such that elements can be negative also and the given sum can be negative also.
Some questions on projects I had worked on. He asked me about any task that was not satisfactory but still went into production. How did you talk to your manager and take initiative to fix it?
Round 2: Hiring Manager
Train reservation LLD – full discussion on various entities involved, there attributes and how you will serve the train search results.
Asked me about any conflict I had with any team member and how was I able to resolve it.
Asked me about something that was released into production and was modified later.
He asked me about some microservices I worked on, since I had mentioned them in my intro. He asked me to explain the design of some services that I was handling.
Round 3: Design
There was only 1 design question that was asked in this interview.
Food Delivery app design – Brief HLD was discussed but mainly I had to make and explain the entire LLD – the entities involved, attributes, service classes for various flows like search, order, payment, track order, etc.
Round 4: Design + DS
Tinder design. Mainly he was interested in HLD and how will you implement various flows.
DS question 1: Find maximum sum in an array such that no 2 numbers are adjacent to each other.
DS question 2: Minimum length Substring in a string S that contains all chars of another string T.
Round 5: DS
Asked me about projects I worked on. Also asked me to explain some recent thing I had developed.
Given a matrix of pixels(each pixel has colour code and brightness value associated with it), find a region with maximum brightness. A region is an area of only one colour.
Given a method deploy(a, b) which deploys all commits of project A from 1 to a and all commits of project B from 1 to b. deploy(a, b) gives true if all commits i.e. 1-a and 1-b are not faulty. Otherwise false. We are given that deploy(a, b) is failing and there is only 1 faulty commit. How will you find that faulty commit.
- Practice writing code on paper. You are expected to write production ready and bug free code of all DS questions.
- For design, focus on concepts rather than the exact design solution. It will help you be ready for any kind of design problem.
- The interviewers give high attention to behavioural questions like that asked in Hiring Manager rounds. So make sure that you prepare for them beforehand.
- You should also be able to explain clearly all the projects that you have done in your current organisation.
Besides that – Be confident, Believe in yourself and All the best.
- Amazon Interview Experience SDE-1 | Amazon-WOW 2020
- Amazon Interview Experience | Set 167 (SDE I for 1 year 6 months experience)
- Amazon Interview Experience | Set 241 (1.5 years experience)
- Amazon Interview Experience | Set 243 (2.5 Years Experience)
- Amazon Interview Experience | Set 242 (1 Year 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 (For Experience - 2.8 yrs) | SDE 1
- Amazon Interview Experience | Set 248 (4.8 Yrs Experience for SDE II)
- Amazon interview Experience | Set 415 (For SDE-2)
- Amazon Interview Experience | Set 400 (For SDE 2)
- Amazon Interview Experience SDE 2
- Amazon interview experience | Set 396 (For SDE-2)
- Amazon Interview Experience | Set 425
- Amazon Interview Experience | Set 392 (For SDE 2)
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.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.