Amazon Interview Experience by Shiwanand Chaurasiya | On Campus - Aug 2019

New update is available. Click here to update.

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

SDE - 1

Amazon

3 rounds | 7 Coding problems

Shiwanand Chaurasiya

Fresher | Aug 2019

Selected

Interview preparation journey

Journey

I kept practicing DSA and CS fundamentals from the 3rd year of Engineering. Along with it, I was also learning web development and I made some good projects. Amazon was the first company that visited our campus. I left no stone unturned, went through the previous interview experiences, polished my skills and eventually cracked the very first interview that I sat down for in my life.

Application story

This company visited to my campus for the placement. We just had to upload resume and fill all details in the form. First, they took the online assessment. Later, they called us for the interview rounds.

Why selected/rejected for the role?

The basic reason for my selection was my strong knowledge of core DSA fundamentals and my problem-solving ability. I was selected because I had developed skills like DSA, problem-solving, and Logical building ability. I also prepared for the HR round because all the questions asked in the HR round I was already familiar with them. I was able to pick the hints given by interviewer and build my answers based on the hints provided.

Preparation

Duration: 6 months

Topics: Basic Computer Science background

Tip

Tip 1 : Participate in live contests on websites like Codechef, Codeforces etc as much as possible.
Tip 2 : Practice previous interview questions from LeetCode, GeeksForGeeks.
Tip 3 : Revise Computer Science subjects like DBMS, OOPS thoroughly.

Application process

Where: Campus

Eligibility: 6 CGPA

Resume tip

Add projects and Internships if you have done any and add only those things which you really know.

Interview rounds

Round

Easy

Online Coding Test

Duration90 minutes

Interview date28 Aug 2019

Problems2

This was MCQ+Coding round.

1. Coding MCQs

There were a total of 19 MCQs.

Topics: Trees(5), semaphores(3), deadlocks(5) and algorithms(6)

2. Anagram Pairs

Check if two strings are anagram or not.

Problem approach

I simply used hashing to solve this problem by checking the frequency of characters in both strings.

Try solving now

Round

Easy

Face to Face

Duration90 minutes

Interview date29 Aug 2019

Problems2

This was face to face interview round.

1. Next greater number with same set of digits

Given a number n, find the smallest number that has same set of digits as n and is greater than n. If n is the greatest possible number with its set of digits, then print “not possible”.

Examples:

For simplicity of implementation, we have considered input number as a string.

Input: n = "218765"

Output: "251678"

Input: n = "1234...

Problem approach

I have done this question earlier so just use already built algorithm which traverses the number from the back.

Try solving now

2. Circular Move

Given a sequence of moves for a robot, check if the sequence is circular or not. A sequence of moves is circular if first and last positions of robot are same. A move can be on of the following.

G - Go one unit

L - Turn left

R - Turn right

Examples:

Input: path[] = "GLGLGLG"

Output: Given sequence of moves is...

Problem approach

I simply started from 0,0 point and if the robot again reaches to 0,0 point then motion is circular. I explained my whole approach on paper to the interviewer.

Try solving now

Round

Easy

Face to Face

Duration90 minutes

Interview date29 Aug 2019

Problems3

This was face to face interview round.

1. Number of islands

Given a boolean 2D matrix, find the number of islands. A group of connected 1s forms an island. For example, the below matrix contains 5 islands

Example:

Input : mat[][] = {{1, 1, 0, 0, 0},

{0, 1, 0, 0, 1},

{1, 0, 0, 1, 1...

Problem approach

Simply gave the interviewer, Depth-first search based approach by visiting adjacent connected components and counting the number of islands. The interviewer was satisfied with my approach.

Try solving now

2. Reverse stack .

Reverse stack using recursion.

Problem approach