New update is available. Click here to update.
SDE - Intern
Amazon
3 rounds | 8 Coding problems
186 views
Interview preparation journey
Preparation
Duration: 6 months
Topics: DSA, OOPS, DBMS, Machine Learning, ReactJS, HTML/CSS, C++, Javascript, Deep Learning
Tip

Tip 1 : Only mention courses and topics in your Resume you are confident in and it would be better if you revise OOPS, DBMS.
Tip 2 : Explain your project in STAR format and also read about the leadership qualities.
Tip 3 : Before the interview try to check important topics or things specific to the company. Like trees and Linked list are important topics for Amazon

Application process
Where: Campus
Eligibility: above 7 CGPA and only for circuital branches
Resume tip

Tip 1 : Only mention courses, topics and projects in your Resume you are confident in.
Tip 2 : Do unique projects in the area which you want to apply to.
Tip 3 : Keep updating your resume according to the role you are applying to

Interview rounds
01
Round
Medium
Online Coding Interview
Duration150 mins
Interview date15 Sep 2021
Problems4
NINJA'S TRUCK

#### Ninja is assigned a task to deliver some boxes which contain different units having differen...

view more
Problem approach

Step 1 : sort boxTypes so that boxes with the most units appear first.
Step 2 : Iterate through the boxes in sorted order.
Step 3 : Instead of counting down one by one how many boxes to take, we can calculate how many boxes of the current type to take by taking min(truckSize, numberOfBoxes). This is because the truck can fit at most truckSize more boxes, but we have numberOfBoxes left.

view more
Maximum In Sliding Windows Of Size K

#### Given an array/list of integers of length ‘N’,...

view more
Problem approach

Step 1 : Create a descending order map, and insert first k elements. our map's first element will;point to the greatest element in the map.
Step 2 : In the second for loop, as its a sliding window, I'm removing the first elem(
a[k-i]) and adding the current upcoming elem (a[i]) into the window.
Step 3 : for that I'm decreasing the element's frequency in the map. also note that decreasi...

view more
Puzzle

This was another section of Work Life assessment. Each question had a slider which was in the middle at the start, we had to move it either way which we think is most appropriate according to us.
Both sides have different viewpoints and two options most likely and more likely.
ViewPoint 1 ----------------------------------------------------------------------- ViewPoint 2
<-----Most ...

view more
Problem approach

Tip 1: These questions should be explained according to Amazon's Leadership principles

Puzzle

It had 24 questions. You cannot navigate( move back and forth) in questions. Time is the key here, the questions were really basic and easy, encoding-decoding questions, some paragraph based questions, series based questions

02
Round
Easy
Video Call
Duration50 mins
Interview date20 Sep 2021
Problems2
Kth smallest node in BST

#### You have been given a Binary Search Tree of integers. You are supposed to return the k-th (1-indexed) smallest element in the tree.

##### For example:
view more
Problem approach

Step 1 : Initially, I gave the naive approach of traversing the tree in Inorder and while traversing, keep track of the count of the nodes visited. If the count becomes k, print the node and end the program. Complexity of this code is O(n) time and O(h) auxiliary space which I explained too and further asked if it is required to improve before starting to implement it.
Step 2 : Then I was as...

view more
First non repeating character
view more
Problem approach

Step 1 : Initially, I explained an array-based approach similar to this one:Method 3 of https://www.geeksforgeeks.org/given-a-string-find-its-first-non-repeating-character/
So each time the find answer function is called we will have to traverse the fi[256] array each time to return the answer.
Step 2 : Then he asked me to try a different approach for a situation in which the Find A...

view more
03
Round
Medium
Video Call
Duration75 mins
Interview date20 Sep 2021
Problems2
Find Character Case

#### Write a program that takes a character as input and prints either 1, 0, or -1 according to the following rules.

``````1, if the character is an uppercase alphabet (A - Z)
0, if ...``````
view more
Problem approach

Step 1 : I gave the recursive approach, he told me to code.
Step 2 : After that he told me to dry run the approach for {a,b,c}, i tried to make the recursion tree on the editor but it was all messy after a few steps. He then shared a whiteboard link for that, it was taking lot of time doing there so finally he shared his whatsapp and told to do it on paper and send him the image, around 35 m...

view more
Gas Stations

#### You have been given a circular path. There are 'N' petrol pumps on this path that are numbered from 0 to N - 1 (Both inclusive). Each petrol pump has two values associated with it:

view more
Problem approach

Step 1 : I had solved this question before and after some time told him the O(n) approach. He told me to code. I did so explaining each step along. I had two nested for loops in the code, so he inquired about how the approach is linear in time.
Step 2 : We had some discussion on the code and I had to explain some parts to him again. He suggested some changes too. I deleted 4-5 lines fo...

view more
Join the Discussion
2 replies
Anshu |Level 6
1 month ago

why was u use recursive approch in Find Character Case, if u can solve it by iterative approch.

1 upvote
1 month ago
``Gsgggsvvvvvbbehhhgsgggsvvvvvbbehhhhhbhehhhg Gggggajjhe bsbhhehhvhhheuuhehe``
0 replies
Similar interview experiences
Software Engineer
3 rounds | 5 problems
Interviewed by Amazon
1685 views
SDE - 1
3 rounds | 4 problems
Interviewed by Amazon
1720 views
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
1613 views
SDE - 1
2 rounds | 3 problems
Interviewed by Amazon
1698 views
Companies with similar interview experiencs
SDE - Intern
2 rounds | 3 problems
Interviewed by Trilogy Innovations
16756 views