Amazon Interview Experience by Avinash Jindal

New update is available. Click here to update.

SDE - 1

Amazon

3 rounds | 6 Coding problems

Avinash Jindal

Fresher | Feb 2022

Selected

1907 views

3 comments

21 upvotes

Interview preparation journey

Preparation

Duration: 6 months

Topics: Data Structures, Operating Systems, OOPS, Low-level Design, Algorithms, Dynamic Programming

Tip

Tip 1 : Practise Atleast 500 questions
Tip 2 : Do Atleast 3 projects
Tip 3 : Atleast 1 internship experience

Application process

Where: Other

Eligibility: Above 7 CGPA

Resume tip

Tip 1 : Add your coding background
Tip 2 : Add at least 3 projects and 1 internship experience

Interview rounds

Round

Medium

Video Call

Duration60 minutes

Interview date22 Feb 2022

Problems2

Coin Change(Finite Supply)

You are given an array of integers ‘coins’ denoting the denomination of coins and another array of integers ‘freq’ denoting the number of coins of each denomination.

Problem approach

I first applied recursive approach. It was not good enough
I then applied DP approach and solved it using memoization.

Try solving now

Best Time to Buy and Sell Stock

maxProfit = 0
if price[i] > price[i – 1]
maxProfit = maxProfit + price[i] – price[i – 1]

Problem approach

maxProfit = 0;
if price[i] > price[i – 1]
maxProfit = maxProfit + price[i] – price[i – 1]

Try solving now

Round

Medium

Video Call

Duration60 minutes

Interview date22 Feb 2022

Problems2

Trapping Rain Water

You have been given a long type array/list 'ARR' of size 'N'. It represents an elevation map wherein 'ARR[i]' denotes the elevation of the 'ith'...

Problem approach

Search from left to right and maintain a max height of left and right separately, which is like a one-side wall of partial container. Fix the higher one and flow water from the lower part. For example, if current height of left is lower, we fill water in the left bin. Until left meets right, we filled the whole container.

Try solving now

Pair Sum in BST

You are given a Binary Search Tree (BST) and a target value ‘K’. Your task is to check if there exist two unique elements in the given BST such that their sum is equal to the given target ‘K’.

Problem approach

create an auxiliary array and store the Inorder traversal of BST in the array. The array will be sorted as Inorder traversal of BST always produces sorted data. Once we have the Inorder traversal we can get the answer using 2 pointer approach

Try solving now

Round

Easy

Video Call

Duration60 minutes

Interview date17 Jun 2022

Problems2

The Celebrity Problem

There are ‘N’ people at a party. Each person has been assigned a unique id between 0 to 'N' - 1(both inclusive). A celebrity is a person who is known to everyone but does not know anyone at t...

Problem approach

-Create two indices i and j, where i = 0 and j = n-1
-Run a loop until i is less than j.
-Check if i knows j, then i can’t be a celebrity. so increment i, i.e. i++
-Else j cannot be a celebrity, so decrement j, i.e. j–
-Assign i as the celebrity candidate
-Now at last check that whether the candidate is actually a celebrity by re-running a loop from 0 to n-1 and
constant...

Try solving now

System Design Question

Design an Api which implement 3 function:
1: Search in a list(Employees) on the basis of params
2: Add in a list
3: Remove from a list(with Employee ID)

Problem approach

Tip 1 : Have a grip on Low level designs
Tip 2 : Apply the concept of Oops