Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding Ninjas X Naukri.com
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: 6 Months
Topics: Data structures and Algorithms, Computer Networks, Operating Systems, Web Technologies
Tip
Tip

Tip 1 : Understand the concept for any algorithm you are studying, focus on how things are working even in single line of code, if you do that number of questions doesn't matter.
Tip 2 : Don't get confuse while choosing which online platform is good and which one is bad, Every platform has enough resources to crack any interview. Just make sure you completely finish atleast one platform. If you like CP then start practicing on SPOJ/Codeforces/TopCoder/CodeChef.

Application process
Where: Campus
Eligibility: CGPA > 6 and not from Mechanical and Electrical Engineering,
Resume Tip
Resume tip

Tip 1 : Be confident about every single word written in your resume.
Tip 2 : Make sure your resume is of 1 page only.

Interview rounds

01
Round
Easy
Online Coding Interview
Duration90 Minutes
Interview date2 Aug 2019
Coding problem2

The round was scheduled at 10 AM on 2nd August, 2019, But it started a little late due to some issues in Lab devices. The test started in a full screen mode and no one was allowed to exit full screen mode.

1. Remainder When Divided By 11

Easy
15m average time
85% success
0/40
Asked in companies
IntuitAmazonRaja Software Labs (RSL)

You are given a number N. You need to find the remainder when N is divided by 11.

Note :
Number N may be very large.
Try solving now

2. Missing Number

Moderate
30m average time
70% success
0/80
Asked in companies
FacebookAppleAmazon

You are given an array/list ‘BINARYNUMS’ that consists of ‘N’ distinct strings which represent all integers from 0 to N in binary representation except one integer. This integer between 0 to ‘N’ whose binary representation is not present in list ‘BINARYNUMS’ is called ‘Missing Integer’.

Your task is to find the binary representation of that ‘Missing Integer’. You should return a string that represents this ‘Missing Integer’ in binary without leading zeros.

Note

1. There will be no leading zeros in any string in the list ‘BINARYNUMS’.

Example:

Consider N = 5 and the list ‘binaryNums’=  [“0”, “01”, “010”, “100”, “101”].  This list consists of the binary representation of numbers [0, 1, 2, 4, 5]. Clearly, the missing number is 3 and its binary representation will be “11”. So you should return string “11”.
Try solving now
02
Round
Medium
Face to Face
Duration60 Minutes
Interview date19 Aug 2019
Coding problem2

It was a F2F interview. The interviewer was very friendly and was working as an SDE II in Consumers team. He started with quick intro of himself and then asked mine. Then jumped into coding question. He was monitoring my every single activity throughout the interview and told me ignore whenever I type something on my laptop.

1. Fish Eater

Easy
15m average time
85% success
0/40
Asked in companies
OlaAmazon

There is a river which flows in one direction. One day, the river has 'N' number of fishes. You are given an array 'FISHES' of integers representing the size of 'N' fishes. The fishes are present in the river from left to right(0th index represents the size of the leftmost fish). As the river flows from left to right so the fishes also swim from left to right. The fishes are of different sizes and have different speeds. The larger fishes are faster than the smaller fishes. Also, larger fishes can eat smaller fishes but can’t eat fishes of the same size.

Can you find the number of fishes that survive at the end of the day?

Example:
Let the size of fishes present in the river from left to right be{ 4, 2, 3, 1, 5 }.

1. As fish 4 is faster and bigger than fish 2, so fish 4 will eat fish 2.
    Remaining fishes: { 4, 3, 1, 5 }

2. As fish 3 is faster and bigger than fish 1, so fish 3 will eat fish 1.
    Remaining fishes: { 4, 3, 5 }

3. As fish 4 is faster and bigger than fish 3, so fish 4 will eat fish 3.
    Remaining fishes: { 4, 5 }

Now fish 5 cannot eat fish 4, as fish 5 is faster than fish 4 and they swim from left to right. Thus, fish 4 will never reach fish 5.

Finally, we are left with only 2 fishes.
Try solving now

2. Fishmonger

Hard
30m average time
60% success
0/120
Asked in companies
SamsungAmazonHexaware Technologies

A fishmonger wants to bring his goods from port to the market. On his route, he has to traverse an area with many states. He has to pay a toll at each border.

He is a good businessman. He wants to choose the route in such a way that he has to pay as little money for tolls as possible. On the other hand, he has to be at the market within a particular time. Otherwise, his fish will start to smell.

You are given ‘N’ number of states and the time ‘M’ in which he has to reach the market. You need to return the minimum toll amount that he has to pay to reach the market in the given time. The 0’th index is the port, and the 'N'-1 index is the market.

For example:
Consider If N = 2 , M = 4, Time = [[0,  2], [3,  0]] and Toll = [[0, 10], [ 5,  0]]]
The optimal path to reach node 1 from node 0 is 0 -> 1. The time required in the path is 2, and the minimum toll needed within the given time constraints is 10. Hence the answer is 10.
Try solving now
03
Round
Medium
Face to Face
Duration75 Minutes
Interview date19 Aug 2019
Coding problem2

It was a F2F interview. The interviewer was very friendly and was working as an SDE III in Payments team. He started with quick intro of himself and then asked mine. He asked me about the project I mentioned in my resume and some questions regarding the project. Then jumped into coding question. He was monitoring my every single activity throughout the interview.

1. Battalions and tanks

Moderate
10m average time
90% success
0/80
Asked in companies
HSBCAmazon

Let there be ‘N’ battalions of soldiers and ‘M’ tanks. You are also given an array/list of length ‘N’ whose i-th index denotes the number of soldiers in the i-th battalion. You are supposed to divide the ‘M’ tanks to ‘N’ battalions such that the maximum ratio of soldiers in a battalion to the number of tanks allotted to that battalion is minimised.

You can assume that the number of tanks is always greater than the number of battalions.

Try solving now

2. Diagonal Traversal of a binary tree.

Easy
10m average time
90% success
0/40
Asked in companies
Paytm (One97 Communications Limited)AmazonSalesforce

You have been given a binary tree of integers. You are supposed to find the diagonal traversal(refer to Example) of the given binary tree.

Example:

Consider lines at an angle of 135 degrees(with respect to standard X- axis)  in between nodes. Then, all nodes between two consecutive lines belong to the same diagonal

alt text

The diagonal traversal for the above tree is: 

0 2 6 1 5 3 4 7 
Try solving now

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

Suppose list1 is [2, 133, 12, 12], what is max(list1) in Python?

Choose another skill to practice
Start a Discussion
Similar interview experiences
company logo
SDE - Intern
3 rounds | 3 problems
Interviewed by Amazon
1240 views
0 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 7 problems
Interviewed by Amazon
452 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 3 problems
Interviewed by Amazon
454 views
0 comments
0 upvotes
company logo
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
823 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
12619 views
1 comments
0 upvotes
company logo
SDE - Intern
3 rounds | 6 problems
Interviewed by Microsoft
7475 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 3 problems
Interviewed by Google
5326 views
1 comments
0 upvotes