'Coding has over 700 languages', '67% of programming jobs aren’t in the technology industry', 'Coding is behind almost everything that is powered by electricity'
Amazon interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Amazon
upvote
share-icon
2 rounds | 7 Coding problems
Interview preparation journey
expand-icon
Preparation
Duration: 1.5 months
Topics: Data Structures, Algorithms, DBMS, Dynamic programming, Computer network basics
Tip
Tip

Tip 1 : Be very very clear with your basics.
Tip 2 : Think well before giving an answer
Tip 3 : Practice, practice, practice DS Algo questions

Application process
Where: Company Website
Eligibility: Only females
Resume Tip
Resume tip

Tip 1 : Limit it to 1 page ONLY.
Tip 2 : Be ready to face all kinds of questions on topics you have mentioned in the resume.

Interview rounds
01
Round
Medium
Online Coding Interview
Duration150 minutes
Interview date24 May 2020
Coding problem2

We could attempt at any time out of the 3 given days.
The round was very time constrained and we could NOT go back to the question that we already attempted.

1. Merge two sorted linked list
Moderate
15m average time
80% success
0/80
Asked in companies
IntuitUnacademySamsung

You are given two sorted linked lists. You have to merge them to produce a combined sorted linked list. You need to return the head of the final linked list.

Note:

View more
Problem approach

1. Compare the head of both linked lists.
2. Find the smaller node among the two head nodes. The current element will be the smaller node among two head nodes.
3. The rest elements of both lists will appear after that.
4. Now run a recursive function with parameters, the next node of the smaller element and the other head.
5. The recursive function will return the next smaller eleme...

View more
Try solving now
2. AWS Trucks

The problem statement involved the use of amazon trucks which had to deliver system requirements across an AWS region which contains N office buildings. The various location of buildings are given in a vector of  (x,y) coordinates along with an adjacency matrix deniying tge connectivity. The head branch is located at (0,0). The truck starts at the head branch and after visiting other branc...

View more
Problem approach

1. It's basically a problem of visiting each node of a graph exactly once in a cycle. So its a Hamiltonian cycle which can be found out using backtracking
2. Create an empty path array and add vertex 0 to it.
3. Add other vertices, starting from the vertex 1. Before adding a vertex, check for whether it is adjacent to the previously added vertex and not already added.
4. If we find suc...

View more
02
Round
Hard
Video Call
Duration60 minutes
Interview date26 Jun 2020
Coding problem5

Evening at 5:00 pm. It was held on Amazon Chime app
Face cam was to be kept on COMPULSARILY. You could however not see the interviewer.
Codepen type environment was also used for typing my code which could be edited by the interviewer also.
(Shared document kind of)
Interviewer was very professional and was trying to push me towards getting the most optimal solution. Each and every answer was asked a counter question as to why I made that choice

1. Missing Numbers
Easy
28m average time
85% success
0/40
Asked in companies
Thought WorksAmazonHexaware Technologies

You are given an array 'ARR' of distinct positive integers. You need to find all numbers that are in the range of the elements of the array, but not in the array. The mis...

View more
Try solving now
2. Maximum element between two nodes of BST
Easy
15m average time
85% success
0/40
Asked in company
Amazon

Given a Binary Search Tree and two integers NODE1 and NODE2. You have to find the maximum element in the path from NODE1 to NODE2.

View more
Problem approach

1. Find the LCA or least common ancestor.
2. Apply binary seatch from LCA to find the greater out of A and B while keeping track of the largest node.

Try solving now
3. Compress the String
Moderate
32m average time
60% success
0/80
Asked in companies
InfosysHexaware TechnologiesArcesium

Write a program to do basic string compression. For a character which is consecutively repeated more than once, replace consecutive duplicate occurrences with the count of repetitions.

E...
View more
Problem approach

1. Use a hashmap m to keep track of number of times a character has occured. Use a vector v to store the order of occurence
2. When you encouter a char, see if its present in m
If yes, the increase the count in m.
Else, make entry of char in m with count 1 and enter char in the vector
3. Print all the elements in the vector with the corresponding frequency by looking up the hashmap ...

View more
Try solving now
4. OS Question

What is deadlock? How to recover from them? How to prevent them?
Difference between thread and process?

Problem approach

Tip 1 : Be very precise and to the point.
Tip 2 : Be extremely clear with the concept.
Tip 3 : Don't use fancy terms which you yourself don't know about.

5. DBMS Questions

What is ACID, explain with examples. Questions on join queries.

Problem approach

Tip 1: While giving examples, give short and relevant ones
Tip 2: Practice queries thoroughly
Tip 3: No need to learn very hifi concepts. STICK TO YOUR BASICS

Start a Discussion
Similar interview experiences
company logo
SDE - 1
4 rounds | 7 problems
Interviewed by Amazon
2117 views
0 comments
0 upvotes
company logo
SDE - 1
4 rounds | 9 problems
Interviewed by Amazon
1225 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by Amazon
440 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by Amazon
94 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
43256 views
5 comments
0 upvotes
company logo
SDE - 1
4 rounds | 8 problems
Interviewed by Samsung
9748 views
2 comments
0 upvotes
company logo
SDE - 1
2 rounds | 4 problems
Interviewed by Google
7902 views
0 comments
0 upvotes