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

SDE - 1

Amazon
upvote
share-icon
4 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 6 months
Topics: DSA, programming basics and oops, Operating Systems, DBMS,, Aptitude
Tip
Tip

Tip 1 : Always be confident on your programming basics
Tip 2 : Prepare at least one good project (and 1-2 normal basic project)
Tip 3 : Prepare well for basic interview questions

Application process
Where: Campus
Eligibility: 8.5 cgpa
Resume Tip
Resume tip

Tip 1 : Write a powerful summary statement
Tip 2 : Never mention a false certificate or skill in the resume

Interview rounds

01
Round
Easy
Online Coding Interview
Duration70 minutes
Interview date11 Nov 2021
Coding problem1

The online test consists of 2 coding questions to be completed in 70 minutes. The questions are of medium difficulty level.

1. Maximum Of All Subarrays Of Size k.

Moderate
20m average time
80% success
0/80
Asked in companies
AmazonOracleSAP Labs

You are given an array consisting of N non-negative integers, and an integer K denoting the length of a subarray, your task is to determine the maximum elements for each subarray of size K.

Note:
A subarray is a contiguous subset of an array.

The array may contain duplicate elements.

The given array follows 0-based indexing.

It is guaranteed that there exists at least one subarray of size K.
Problem approach

A Simple Solution is to generate all subarrays of size k, compute their sums and finally return the maximum of all sums. The time complexity of this solution is O(n*k).
An Efficient Solution is based on the fact that sum of a subarray of size k can be obtained in O(1) time using the sum of the previous subarray of size k.
This is basically sliding window problem.

Try solving now
02
Round
Medium
Video Call
Duration50 minutes
Interview date14 Nov 2021
Coding problem2

My interviewer asked me to introduce myself and then jumped into coding questions.
Overall I was able to solve both the questions in under 50 minutes.
Later we had a casual discussion on projects and work culture at Amazon for a few minutes.

1. Check If Binary Tree Is Sum Tree Or Not

Moderate
15m average time
85% success
0/80
Asked in companies
AdobeGoldman SachsAmazon

You are given an arbitrary binary tree consisting of N nodes where each node is associated with a certain value. You need to check whether the given tree is a sum tree or not.

A binary tree is a sum tree if the value of each node is equal to the sum of nodes present in the left and the right subtree. An empty tree is a sum tree with 0 sums. A leaf node is also considered a sum tree with a sum equal to the value of the leaf node.

Problem approach

I gave him an optimized solution and discussed its time complexity

Try solving now
Moderate
20m average time
80% success
0/80
Asked in companies
HCL TechnologiesAmazonOracle

You are given an ‘M*N’ Matrix, You need to print all possible paths from its top left corner to the bottom right corner if given that you can either move right i.e from (i,j) to (i,j+1) or down i.e from (i, j) to (i+1, j).

For Example :
1 2 3
4 5 6

For the above 2*3 matrix , possible paths are (1 2 3 6) , (1 2 5 6) , (1 4 5 6).
Note :
You can return the paths in any order.
Try solving now
03
Round
Medium
Video Call
Duration45 minutes
Interview date16 Nov 2021
Coding problem1

He gave an introduction about himself and asked me to do the same. Later he asked me a coding question.
He then showed me multiple code snippets and asked me to calculate time complexities for each of them. 
I answered it in 45 minutes and then we discussed about roles and responsibilities of the job.

1. Maximum Sum BST

Hard
50m average time
55% success
0/120
Asked in companies
AmazonOLX GroupExpedia Group

You are given a Binary Tree ‘root’. The given Binary Tree may or may not be a Binary Search Tree(BST) itself. Your task is to find the maximum sum of node values of any subtree that is a Binary Search Tree(BST).

Binary Search Tree is defined as follows:
1) If the left subtree exists it should contain only nodes with values less than the current node's value.

2) If the right subtree exists it should contain only nodes with values greater than the current node's value.

3) Both the left and right subtrees should also be Binary Search Tree.
Example :

For the above binary tree, the BST with the maximum possible sum is marked with RED colour, the sum of this BST is equal to 6.

 

Try solving now
04
Round
Easy
HR Round
Duration30 minutes
Interview date18 Nov 2021
Coding problem1

We had a discussion on my previous projects for around 30 minutes. He then asked me a few behavioral questions.

1. Basic HR Questions

Tell me about a time when you have exceeded expectations.
Why Amazon?
Tell me about a time when you have delivered late? If yes what was the reason for the delay?
Dislikes and likes
Why do you want to leave your current company?

Problem approach

Tip 1 : Answer Honestly
Tip 2 : Don't get tripped
Tip 3 : Prepare well in advance for common questions

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
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by Amazon
3084 views
0 comments
0 upvotes
company logo
SDE - 1
4 rounds | 8 problems
Interviewed by Amazon
2294 views
1 comments
0 upvotes
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by Amazon
1592 views
0 comments
0 upvotes
company logo
SDE - 1
4 rounds | 8 problems
Interviewed by Amazon
8962 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
58237 views
5 comments
0 upvotes
company logo
SDE - 1
4 rounds | 8 problems
Interviewed by Samsung
12648 views
2 comments
0 upvotes
company logo
SDE - 1
4 rounds | 8 problems
Interviewed by Microsoft
5983 views
5 comments
0 upvotes