Amazon interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Amazon
2 rounds | 2 Coding
problems
Rejected
Interview preparation journey
Preparation
Duration: 5 month
Topics: Dynamic Programming , Array, Tree, Graph, Stack, Operating System
Tip 1 : Don't by heart the question ,understand the concept
Tip 2 : Do at least one question in a day
Application process
Where: Campus
Eligibility: Above 7
Tip 1 : Mention the skill in your resume for which you are applying the role.
Tip 2 : Resume should be 1 page,.
Interview rounds
01
Round
Medium
Online Coding Interview
Duration90 minutes
Interview date8 Oct 2021
Coding problem1
it is consist of MCQ and 3 coding question
1. Minimum Operations
Easy
20m average time
82% success
0/40
Asked in companies
You are given an array 'ARR' of 'N' positive integers. You need to find the minimum number of operations needed to make all elements of the array equal. You can perform addition, multiplication, subtraction or division with any element on an array element.
Addition, Subtraction, Multiplication or Division on any element of the array will be considered as a single operation.
Example:
If the given array is [1,2,3] then the answer would be 2. One of the ways to make all the elements of the given array equal is by adding 1 to the array element with value 1 and subtracting 1 from the array element with value 3. So that final array would become [2,2,2].
Problem approach
The idea is to use BFS for this. We run a BFS and create nodes by multiplying with 2 and subtracting by 1, thus we can obtain all possible numbers reachable from starting number.
Important Points :
When we subtract 1 from a number and if it becomes < 0 i.e. Negative then there is no reason to create next node from it (As per input constraints, numbers x and y are positive).
Also, if we have already created a number then there is no reason to create it again. i.e. we maintain a visited array.
02
Round
Medium
Video Call
Duration60 min
Interview date4 Nov 2021
Coding problem1
Coding Question
1. Reverse Stack Using Recursion
Easy
21m average time
80% success
0/40
Asked in companies
Reverse a given stack of 'N' integers using recursion. You are required to make changes in the input parameter itself.
Note: You are not allowed to use any extra space other than the internal stack space used due to recursion.
Example:
Input: [1,2,3,4,5]
Output: [5,4,3,2,1]
Problem approach
The idea of the solution is to hold all values in Function Call Stack until the stack becomes empty. When the stack becomes empty, insert all held items one by one at the bottom of the stack.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
How do you remove whitespace from the start of a string?
Choose another skill to practice
Similar interview experiences
SDE - 1
3 rounds | 5 problems
Interviewed by Amazon
Rejected
3085 views
0 comments
0 upvotes
SDE - 1
4 rounds | 8 problems
Interviewed by Amazon
Rejected
2295 views
1 comments
0 upvotes
SDE - 1
3 rounds | 6 problems
Interviewed by Amazon
Rejected
1593 views
0 comments
0 upvotes
SDE - 1
4 rounds | 8 problems
Interviewed by Amazon
Selected 8962 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
Selected 58238 views
5 comments
0 upvotes
SDE - 1
4 rounds | 8 problems
Interviewed by Samsung
Selected 12649 views
2 comments
0 upvotes
SDE - 1
4 rounds | 8 problems
Interviewed by Microsoft
Selected 5983 views
5 comments
0 upvotes