'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 - Intern
Amazon
upvote
share-icon
3 rounds | 6 Coding problems
Interview preparation journey
expand-icon
Preparation
Duration: 2.5 months
Topics: Data Structures, Recursion, Dynamic Programming, OOPS, Pointers
Tip
Tip

Tip 1 : Be very clear with the basics of each topic.
Tip 2 : Be thorough with the projects mentioned in the resume.
 

Application process
Where: Campus
Eligibility: Above 7 CGPA
Resume Tip
Resume tip

Tip 1 : Don't lie on your resume.
Tip 2 : The number of projects on the resume does not matter, what matters is that you must be thorough with your projects.

Interview rounds
01
Round
Easy
Online Coding Interview
Duration145 minutes
Interview date20 Sep 2020
Coding problem2

The online assessment consisted of four components, a code debugging section (20 minutes), a coding test (70 minutes), a workstyles assessment (20 minutes) and a reasoning ability section (35 minutes). Code debugging questions were pretty simple and straightforward. The coding test consisted of 2 questions, first was similar to two Sum problem. Second question was similar to find the critical edges in a graph. The workstyles assessment section contained certain behavioural questions.
Reasoning ability section consisted of aptitude questions. This round was basically to check the problem solving skills of the candidate.

1. Two Sum
Easy
10m average time
90% success
0/40
Asked in companies
IndiaMartIntuitBNY Mellon

You are given an array of integers 'ARR' of length 'N' and an integer Target. Your task is to return all pairs of elements such that they add up to Target.

Note:

View more
Problem approach

This problem was pretty standard. the solution is easily available online.

Try solving now
2. Bridges in a Graph
Moderate
25m average time
65% success
0/80
Asked in companies
SprinklrOlaInfosys

Given an undirected graph of V vertices and E edges. Your task is to find all the bridges in the given u...

View more
Problem approach

I applied dfs in the above problem with slight modifications.

Try solving now
02
Round
Medium
Video Call
Duration60 minutes
Interview date30 Sep 2020
Coding problem2

I was asked two coding questions. First question was related to binary tree and second question was to implement LRU cache.
I had to code both questions. The interviewer asked me the time and space complexity for both the questions.

1. Circular Array Loop
Hard
45m average time
55% success
0/120
Asked in companies
AmazonMicrosoft

You are given a circular array 'ARR' of size 'N', consisting of positive and negative integers. For each index 'i', if ARR[i] is positive then...

View more
Problem approach

I solved this problem using DFS and BFS. 

Try solving now
2. LRU Cache Implementation
Moderate
25m average time
65% success
0/80
Asked in companies
SAP LabsJP MorganJP Morgan

Design and implement a data structure for Least Recently Used (LRU) cache to support the following operations:

View more
Problem approach

I used a queue, doubly linked list and hashmap to solve this problem in constant time complexity.

Try solving now
03
Round
Medium
Video Call
Duration60 minutes
Interview date30 Sep 2020
Coding problem2

I was asked two coding questions and some conceptual questions about priority heap data structure. I was able to code the optimized approach for the first question. But second question was a little tricky for me as I had never heard it before. But I explained my approach confidently. The interviewer also helped me and finally I was able to code it.

1. Connect n ropes with minimum cost
Easy
20m average time
80% success
0/40
Asked in companies
Paytm (One97 Communications Limited)PharmEasyPaypal

You have been given 'N' ropes of different lengths, we need to connect these ropes into one rope. The cost to connect two ropes is equal to sum of their lengths. We need to connec...

View more
Problem approach

Firstly I solved this problem using greedy approach by using min heap.
After writing the code of this problem, I was asked follow up questions about heap data structure. One question was what if a binary tree was used to store the elements of the heap instead of an array.

Try solving now
2. Langford pairing
Easy
10m average time
90% success
0/40
Asked in companies
AmazonMAQ Software

You are given a positive integer N. Return a list of integers of size 2N containing all the integers from 1 to N (both inclusive) twice arranged according to <...

View more
Problem approach

I started explaining my approach to the interviewer starting with brute force approach, then I told him that recursion can be used and finally coded it. It was not the optimized version but still I managed to give an approach that came to my mind.

Try solving now
Start a Discussion
Similar interview experiences
company logo
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
2941 views
1 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
2105 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 5 problems
Interviewed by Amazon
608 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
5913 views
1 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
9333 views
1 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 6 problems
Interviewed by Microsoft
6478 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 3 problems
Interviewed by Google
4378 views
1 comments
0 upvotes