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

# SDE - Intern

Amazon
3 rounds | 6 Coding problems

## Interview preparation journey

Preparation
Duration: 6 months
Topics: Data Structures, OOPS, Algorithms, Graph Traversal, Priority Queue
Tip

Tip 1 : Practice standard Data Structures Questions
Tip 2 : Should have command over the topics on your resume.
Tip 3 : Knowledge of the latest technology domains

Application process
Where: Campus
Eligibility: Above 6.5 CGPA
Resume tip

Tip 1 : Having good projects with proper knowledge about them
Tip 2 : Relevant skill set as demanded by the company for the job description.

## Interview rounds

01
Round
Medium
Online Coding Interview
Duration150 minutes
Interview date27 Sep 2020
Coding problem2

The round began at 3:00 PM. It was an online coding round with four sections. We were not allowed to shuffle between the sections. The sections were :-

1. Logical Reasoning and Verbal Ability for around 35 minutes
2. Debugging for 15 minutes
3. Coding for 50 minutes
4. Behavorial (like a pscycometric test) for 50 minutes.

### 1. Two Sum

Easy
10m average time
90% success
0/40

#### Note:

We cannot use the element at a given index twice.

Try to do this problem in O(N) time complexity.

### 2. Merge Two Sorted Linked Lists

Moderate
15m average time
80% success
0/80

#### Note:

The given linked lists may or may not be null.

#### For example:

If the first list is: 1 -> 4 -> 5 -> NULL and the second list is: 2 -> 3 -> 5 -> NULL

The final list would be: 1 -> 2 -> 3 -> 4 -> 5 -> 5 -> NULL
02
Round
Hard
Video Call
Duration60 minutes
Interview date13 Nov 2020
Coding problem2

The round began at 1:00 PM. It was a video call by the technical expert of the company. It was a DS&Algo round. The interviewer was friendly and helped me walk through the problem set. Overall a very lively interaction with quality questions.

### 1. Longest Consecutive Sequence

Moderate
40m average time
70% success
0/80

#### Note:

If there are any duplicates in the given array we will count only one of them in the consecutive sequence.
##### For example-
For the given 'ARR' [9,5,4,9,10,10,6].

Output = 3
The longest consecutive sequence is [4,5,6].
Can you solve this in O(N) time and O(N) space complexity?

### 2. Two Sum in a BST

Moderate
30m average time
65% success
0/80

#### A binary search tree (BST), also called an ordered or sorted binary tree, is a rooted binary tree whose internal nodes each store a value greater than all the values keys in the node's left subtree and less than those in its right subtree.

Can you solve this in O(N) time, and O(H) space complexity?
03
Round
Hard
Video Call
Duration65 minutes
Interview date13 Nov 2020
Coding problem2

The round was scheduled in the evening on the same day at 6:00 PM. The interviewer was different this time. The overall environment of the interview was good. I felt comfortable and things were more on a smoother pace in this interview.

Easy
20m average time
80% success
0/40

### 2. Zigzag Binary Tree Traversal

Easy
10m average time
90% success
0/40

#### Return the level-order traversal of the Binary Tree.

##### Example:
Input: Consider the following Binary Tree:

Output:
Following is the level-order traversal of the given Binary Tree: [1, 2, 3, 5, 6, 4]

Here's your problem of the day

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

What does ROLLBACK do in DBMS?

Start a Discussion
Similar interview experiences
SDE - Intern
3 rounds | 3 problems
Interviewed by Amazon
1122 views
SDE - Intern
3 rounds | 7 problems
Interviewed by Amazon
387 views
SDE - Intern
2 rounds | 3 problems
Interviewed by Amazon
391 views
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
508 views
Companies with similar interview experiences
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
12231 views
SDE - Intern
3 rounds | 6 problems
Interviewed by Microsoft
7392 views
SDE - Intern
2 rounds | 3 problems