Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding
Ninjas X Naukri.com

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

Amazon

4 rounds | 4 Coding
problems

Preparation

Duration: 3 months

Topics: Data Structures (Graph and trees are important), System Design, Dynamic Programming

Tip

Tip 1 : While solving the questions never see the answer at least try for an hour then see the logic (I mean Algorithm) then try on your own still it's not solved then see the solution code.

Tip 2 : According to me it's not important how many programmes did you solved important is how deeply understood the every programme while solving.

Application process

Where: Referral

Eligibility: No criteria

Resume tip

Tip 1 : Read the Job description highlight the words which related to it for an example skills , experience and projects.

Tip 2 : Have some good projects (or) Internship it will definitely increase the chances of getting an interview.

01

Round

Easy

Telephonic

Duration20 Minutes

Interview date15 Jan 2021

Coding problem0

I was asked about my past internships and projects.

02

Round

Medium

Online Coding Test

Duration45 Minutes

Interview date17 Jan 2021

Coding problem2

Interviewer was good He asked me 2 coding questions while solving he gave some hints as well then we discussed about my projects.

```
An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase. We can generalize this in string processing by saying that an anagram of a string is another string with the same quantity of each character in it, in any order.
```

```
{ “abc”, “ged”, “dge”, “bac” }
In the above example the array should be divided into 2 groups. The first group consists of { “abc”, “bac” } and the second group consists of { “ged”, “dge” }.
```

```
1. A node will be in the bottom-view if it is the bottom-most node at its horizontal distance from the root.
2. The horizontal distance of the root from itself is 0. The horizontal distance of the right child of the root node is 1 and the horizontal distance of the left child of the root node is -1.
3. The horizontal distance of node 'n' from root = horizontal distance of its parent from root + 1, if node 'n' is the right child of its parent.
4. The horizontal distance of node 'n' from root = horizontal distance of its parent from the root - 1, if node 'n' is the left child of its parent.
5. If more than one node is at the same horizontal distance and is the bottom-most node for that horizontal distance, including the one which is more towards the right.
```

```
Input: Consider the given Binary Tree:
```

```
Output: 4 2 6 3 7
Explanation:
Below is the bottom view of the binary tree.
```

```
1 is the root node, so its horizontal distance = 0.
Since 2 lies to the left of 0, its horizontal distance = 0-1= -1
3 lies to the right of 0, its horizontal distance = 0+1 = 1
Similarly, horizontal distance of 4 = Horizontal distance of 2 - 1= -1-1=-2
Horizontal distance of 5 = Horizontal distance of 2 + 1= -1+1 = 0
Horizontal distance of 6 = 1-1 =0
Horizontal distance of 7 = 1+1 = 2
The bottom-most node at a horizontal distance of -2 is 4.
The bottom-most node at a horizontal distance of -1 is 2.
The bottom-most node at a horizontal distance of 0 is 5 and 6. However, 6 is more towards the right, so 6 is included.
The bottom-most node at a horizontal distance of 1 is 3.
The bottom-most node at a horizontal distance of 2 is 7.
Hence, the bottom view would be 4 2 6 3 7
```

03

Round

Hard

Online Coding Test

Duration50 Minutes

Interview date27 Jan 2021

Coding problem2

In this interview she asked me one coding question and system design questions.

```
• The left subtree of a node contains only nodes with data less than the node’s data.
• The right subtree of a node contains only nodes with data greater than the node’s data.
• Both the left and right subtrees must also be binary search trees.
```

Design a URL shortening service

04

Round

Easy

HR Round

Duration30 Minutes

Interview date5 Feb 2021

Coding problem0

In this round he asked me some behavioral questions and then he explained me about my job role.

Here's your problem of the day

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

Suppose list1 is [2, 133, 12, 12], what is max(list1) in Python?

Choose another skill to practice

Start a Discussion

Similar interview experiences

SDE - 1

3 rounds | 5 problems

Interviewed by Amazon

1049 views

0 comments

0 upvotes

SDE - 1

4 rounds | 8 problems

Interviewed by Amazon

1260 views

1 comments

0 upvotes

SDE - 1

3 rounds | 6 problems

Interviewed by Amazon

526 views

0 comments

0 upvotes

SDE - 1

4 rounds | 8 problems

Interviewed by Amazon

1946 views

0 comments

0 upvotes

Companies with similar interview experiences

SDE - 1

4 rounds | 5 problems

Interviewed by Microsoft

50293 views

5 comments

0 upvotes

SDE - 1

4 rounds | 8 problems

Interviewed by Samsung

11190 views

2 comments

0 upvotes

SDE - 1

2 rounds | 4 problems

Interviewed by Google

9821 views

0 comments

0 upvotes