Amazon interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Amazon
upvote
share-icon
3 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Journey
In the beginning, I started learning about basics concept including array, string, stack, queue and solving questions on hackerrank and after becoming confident in these basic topic I move to the next set of topic including link list, tree, graph, dp, etc. I started practicing these topic on Geeksforgeeks, leetcode, codeforces.
Application story
Applied through on Campus placement and the entire process was in online mode. The first round was online technical test that contain coding question . After clearing online technical round then 1 interview round was there taken by SDEs.
Why selected/rejected for the role?
I was selected for the role because I able to satisfy the interviewer with my answer on all DSA problems as well as competitive mathematical problems
Preparation
Duration: 2 Months
Topics: Data Structures and Algorithm, Operating Systems, DBMS, Oops Concepts, Hashing, Computer Networks.
Tip
Tip

Tip 1 : You should have excellent problem solving skills 
Tip 2 : Code a lot.
Tip 3 : You should be thorough with your concepts of Data Structures and Algorithm. 
Tip 4 : Know the complexities of the code that you’ve written.

Application process
Where: Campus
Eligibility: CGPA above 8 and above 85%in 12th.
Resume Tip
Resume tip

Tip 1 : Mention your important projects in detail.
Tip 2 : Try to make a single-page resume. Highlight skills, projects, and work experience more than CGPA. Ensure proper spacing and font to maintain professionalism.
Tip 3 : Keep it precise and concise.
Tip 4 : Mention your achievements related to the role you are applying for.

Interview rounds

01
Round
Medium
Online Coding Interview
Duration40 minutes
Interview date25 Jun 2021
Coding problem2

1. All Prime Numbers less than or equal to N

Moderate
10m average time
90% success
0/80
Asked in companies
AccentureSliceHCL Technologies

You are given a positive integer 'N'. Your task is to return all the prime numbers less than or equal to the 'N'.

Note:

1) A prime number is a number that has only two factors: 1 and the number itself.

2) 1 is not a prime number.
Try solving now

2. Construct tree from Preorder Traversal

Moderate
10m average time
90% success
0/80
Asked in companies
OracleAmazonCodenation

Given an array ‘pre[]’ of ‘n’ elements that represent Preorder traversal of a spacial binary tree where every node has either 0 or 2 children. Also Given a boolean array ‘isLeaf’ such that isLeaf[i] represents if the ‘i-th’ node in the ‘pre’ array is a leaf node or not. Write a function to construct the tree from the given two arrays and return the head node of the constructed binary tree.

For example let pre={1,2,4,5,3,6,7}

isLeaf={0,0,1,1,0,1,1}

Here 0 means that the node is not a leaf node and 1 means that the node is a leaf node.

Then we will have the following tree

alt-1

Try solving now
02
Round
Medium
Online Coding Interview
Duration30 Minutes
Interview date14 Mar 2021
Coding problem2

1. Technical Questions

Which tech stack did you use and why?

What are improvements that can be made to this project, and how?

 

2. Bursting Balloons

Moderate
40m average time
60% success
0/80
Asked in companies
QuikrSamsungOracle

You are given an array 'ARR' of N integers. Each integer represents the height of a balloon. So, there are N balloons lined up.

Your aim is to destroy all these balloons. Now, a balloon can only be destroyed if the player shoots its head. So, to do the needful, he/ she shoots an arrow from the left to the right side of the platform, from an arbitrary height he/she chooses. The arrow moves from left to right, at a chosen height ARR[i] until it finds a balloon. The moment when an arrow touches a balloon, the balloon gets destroyed and disappears and the arrow continues its way from left to right at a height decreased by 1. Therefore, if the arrow was moving at height ARR[i], after destroying the balloon it travels at height ARR[i]-1. The player wins this game if he destroys all the balloons in minimum arrows.

You have to return the minimum arrows required to complete the task.

Try solving now
0
Round
Easy
HR Round
Duration30 minutes
Interview date17 Mar 2021
Coding problem1

1. Basic HR Questions

Introduce yourself.

Where do you see yourself in 5 years?

What do you know about this job?

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

Which SQL keyword removes duplicate records from a result set?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by Amazon
1515 views
0 comments
0 upvotes
company logo
SDE - 1
4 rounds | 8 problems
Interviewed by Amazon
1509 views
1 comments
0 upvotes
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by Amazon
771 views
0 comments
0 upvotes
company logo
SDE - 1
4 rounds | 8 problems
Interviewed by Amazon
3509 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
52129 views
5 comments
0 upvotes
company logo
SDE - 1
4 rounds | 8 problems
Interviewed by Samsung
11504 views
2 comments
0 upvotes
company logo
SDE - 1
2 rounds | 4 problems
Interviewed by Google
10216 views
0 comments
0 upvotes