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

# SDE - 1

Amazon
3 rounds | 6 Coding problems

## Interview preparation journey

Preparation
Duration: 12 months
Topics: C++, Data Structure, Dynamic Programming, Operating system, System Design
Tip

Tip 1 : Practice coding questions and participate in online contests.
Tip 2 : Communication skills are good to have for interviews.

Application process
Where: Campus
Eligibility: 7 CGPA
Resume tip

Tip 1 : Do some good projects for your resume.
Tip 2 : Keep it concise and short.
Tip 3 : Don't lie on your resume.

## Interview rounds

01
Round
Medium
Online Coding Interview
Duration150 minutes
Interview date15 Dec 2020
Coding problem2

Amazon Visited our campus, and they had put a cutoff of 7 CGPA based on which they shortlisted students. After 2 days all the shortlisted students received an online test link.

Online Assessment Test: The round had four sections.

Debugging: There was a total of 7 questions in which a piece of code was written and you had to find any error so that all the test cases can pass. All the questions were very easy.
Coding Section: There were two questions, one was based on a linked list and the other was a logical question based on hashing, I would say both the questions were of medium level. The time allotted was 70 mins total.
Behavioral Analysis: This section consisted of questions that focused on your personality and behavior.
Reasoning Ability: This section was based on aptitude and verbal ability. The difficulty level was easy.

Moderate
10m average time
80% success
0/80

#### You have been given two singly Linked Lists, where each of them represents a positive number without any leading zeros.

View more
Problem approach

The approach is very simple. Traverse both lists and One by one pick nodes of both lists and add the values. If the sum is more than 10 then make carry as 1 and reduce sum. If one list has more elements than the other then consider the remaining values of this list as 0.

The steps are:
1. Traverse the two linked lists from start to end
2. Add the two digits each from respective lin...

View more

### 2. Two Sum

Easy
10m average time
90% success
0/40

#### Note:

View more
Problem approach

This problem can be solved efficiently by using the technique of hashing. Use a hash_map to check for the current array value x(let), if there exists a value target_sum-x which on adding to the former gives target_sum. This can be done in constant time. Let’s look at the following example.

arr[] = {0, -1, 2, -3, 1}
sum = -2
Now start traversing:
Step 1: For ‘0’ there is no valid...

View more
02
Round
Medium
Video Call
Duration90 minutes
Interview date16 Dec 2020
Coding problem2

The round began and first, the interviewer introduced himself and later asked me to introduce myself which I did. After that, he walked me through how the interview is going to proceed from there. He then gave me two coding questions, firstly you have to tell them your approach, and if they are satisfied enough or if your approach is the optimum approach then they will ask you to write that code in their code space which is not an editor btw.

After half an hour I got a call from HR that my interview is scheduled an hour later.

### 1. Square root (decimal)

Easy
10m average time
90% success
0/40

#### You have been given two integers 'N' and 'D', Your task is to find the square root of the number 'N' with precision up to 'D' decimal places...

View more
Problem approach

So, this was a binary search question and there was an easier version of this question in which you had to find only the integer which is closest to the square root of that number, so here you had to only change your code a bit, but the logic was a bit tricky to find, but eventually, I came up with the solution and then the interviewer was quite impressed. I also had to tell the time and space ...

View more

### 2. Spiral Order Traversal of a Binary Tree

Easy
20m average time
75% success
0/40

#### You have been given a binary tree of 'N' nodes. Print the Spiral Order traversal of this binary tree.

##### For example
``For the given binary tree [1, 2,...``
View more
Problem approach

Initially, I thought that this was a tricky problem but I kept thinking out loud, and they were also able to see where and how was I thinking, later I came up with the solution and it was the optimum one, the interviewer again asked me to write how will you represent the generic tree, and then I wrote the code for the tree using a class, the interviewer was again happy to see that, later I wrot...

View more
03
Round
Easy
HR Round
Duration90 minutes
Interview date16 Dec 2020
Coding problem2

The round began with the interviewer’s introduction and then I introduced myself He gave me two questions based on data structures.

The interviewer was happy with all the answers. Then, since enough time was left, He asked me some HR questions, like what are strengths and weaknesses, etc.

After all this, he told me in the interview itself “See you soon and enjoy your day “, after which I was quite sure that I’m going to go to the next round. But this was the last one.

### 1. Connect n ropes with minimum cost

Easy
20m average time
80% success
0/40

#### You have been given 'N' ropes of different lengths, we need to connect these ropes into one rope. The cost to connect two ropes is equal to sum of their lengths. We need to connec...

View more
Problem approach

Tip 1 : Try to tell your approach continuously, as if you are stuck then the interviewer might give a hint.
Tip 2 : Be confident and speak what you think.
Tip 3 : Don't give up on the first try, try to come up with some solution. They see your approach.

### 2. Bottom view of binary tree

Moderate
10m average time
90% success
0/80

#### Return the bottom view of the binary tree.

##### Note :
``1. A node will be in the bottom...``
View more
Problem approach

Tip 1 : Try to tell your approach continuously, as if you are stuck then the interviewer might give a hint.
Tip 2 : Be confident and speak what you think.
Tip 3 : Don't give up on the first try, try to come up with some solution. They see your approach.

Here's your problem of the day

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

What is the result of 4 % 2?

Start a Discussion
Similar interview experiences
SDE - 1
3 rounds | 5 problems
Interviewed by Amazon
823 views
SDE - 1
4 rounds | 8 problems
Interviewed by Amazon
1127 views
SDE - 1
3 rounds | 6 problems
Interviewed by Amazon
432 views
SDE - 1
4 rounds | 8 problems
Interviewed by Amazon
1175 views
Companies with similar interview experiences
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
49225 views