Problem of the day
New update is available. Click here to update.
Amazon interview experience Real time questions & tips from candidates to crack your interview
SDE - Intern
Amazon
3 rounds | 6 Coding
problems
Rejected
Interview preparation journey
Journey
I first learned a programming language in my first year. Then, I practiced DSA from various platforms like Leetcode, GFG, etc. Leetcode is one of the best platforms to practise a wide variety of questions. For other subjects like OS, CN, DBMS etc, I prepared it from my college subjects only.
Application story
I saw openings on Amazon portal for this position. So, I reached out to a lot of Amazon employees on LinkedIn for referral. One of the employees agreed to give me referral. So, I applied through his referral.
Why selected/rejected for the role?
My main reason of rejection was lack of in-depth knowledge of advanced DSA topics like Trees. I hadn't prepared Trees very well , so I wasn't able to give optimised approaches for Tree based questions.
Preparation
Duration: 2 months
Topics: Data Structures, OOPS, Operating Systems, Algorithms, C
Tip 1: Code More
Tip 2: Study Data Structures
Tip 3: Be Confident
Application process
Where: Referral
Eligibility: 6.5 CGPA
Tip 1: Mention only what you are confident about
Tip 2: Mention tools & technologies used in the project as well
Interview rounds
01
Round
Medium
Online Coding Interview
Duration90 minutes
Interview date24 May 2020
Problems2
25 mcqs and 2 coding questions
(It was a part of Amazewow process via Amazewit https://www.amazewit.in/)
Timing- any time between 22-24 may 2020
Webcam was on.
1. Longest Decreasing Subsequence
You are given an array/list ARR consisting of N integers. Your task is to find the length of the longest decreasing subsequence.
View more
Problem approach
I first thought of the brute force approach.
Then tried to solve for LIS which I had already solved once.
Then implemented the approach of DP for LDS.
2. Next Greater Element
You are given an array arr of length N. You have to return a list of integers cont...
View more
02
Round
Medium
Video Call
Duration60 minutes
Interview date30 Jun 2020
Problems2
It held at morning 10 AM.
The interviewer was very friendly.
I was asked to solve 2 coding questions and was continuously provided with hints by the interviewer.
Question was on Array and Trees.
1. Students are standing in the row. given an input of weights of children find the position of a child, such that all students lighter to him are in his left and the ones heavier than him are in his right.
Input: 56 54 63 74 69
Output: 3
Problem approach
I first thought of the brute force approach using 2 for loops.
Then I thought of using a Stack.
Then by using a heap.
Finally, I was able to code it using 2 additional arrays (max and min).
it took O(n) time complexity and O(n2) space complexity.
Edge Case: For the first student, there is no lighter student in front but we only have to consider heavy students for him.
Simil...
View more
2. Transform BST to greater sum tree
You have been given a Binary Search Tree of integers. You are supposed to convert it to a greater sum tree such t...
View more
Problem approach
First I wrote the post order traversal of input,
Then by simply doing post-order traversal and performing swapping in between.
03
Round
Hard
Video Call
Duration45 minutes
Interview date10 Jul 2020
Problems2
Morning 8 AM.
The interviewer was very friendly provided with various hints.
It was covering complex coding questions on Tree Data Structures.
1. Time to Burn Tree
You have a binary tree of 'N' unique nodes and a Start node from where the tree will start to b...
View more
Problem approach
I first thought of DFS, and BFS approaches but then tried using heap but couldn't solve since the approach was wrong.
2. Distance between nodes of a binary tree
Given a binary tree and the value of two nodes, find the distance between the given two nodes of the Binary Tree.
Distance between two nodes is defined as the...
View more
Problem approach
Since I messed up in the first question and already wasted a lot of time. I couldn't come u with any approach.
Was this interview experience helpful?
Join the Discussion
4 replies
why where you rejected?
2 upvotes
Thanks for sharing
2 upvotes
Thanks for sharing your experience, as it will help me to prepare myself for my interviews.
Thanks a lot😚
1 upvote
Similar interview experiences
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
Selected 
2098 views
1 comments
0 upvotes
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
Selected 1803 views
0 comments
0 upvotes
SDE - Intern
2 rounds | 5 problems
Interviewed by Amazon
Selected 322 views
0 comments
0 upvotes
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
Rejected
2730 views
1 comments
0 upvotes
Companies with similar interview experiences
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
Selected 8070 views
1 comments
0 upvotes
SDE - Intern
3 rounds | 5 problems
Interviewed by Microsoft
Selected 5941 views
0 comments
0 upvotes
SDE - Intern
2 rounds | 3 problems
Interviewed by Google
Rejected
3885 views
1 comments
0 upvotes
Popular Interview Experiences:
Download our app:
FOLLOW US ON
We accept payments using:
FOR LDS https://www.codingninjas.com/codestudio/problems/longest-decreasing-subsequence_800300?leftPanelTab=3