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 - 1

Amazon
upvote
share-icon
3 rounds | 4 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 6 Months
Topics: Computer Fundamentals, Data Structures and Algorithms
Tip
Tip

Tip 1 : Participate in previous interview questions from leetcode, geeksforgeeks
Tip 2 : Revise computer science subjects like dbms and oops thoroughly
Tip 3 : Participate in live contests on CodeChef, Codeforces

Application process
Where: Campus
Eligibility: above 7 cgpa
Resume Tip
Resume tip

Tip 1 : Only write the things on which you are the most confident about

Interview rounds

01
Round
Medium
Online Coding Test
Duration90 Minutes
Interview date6 Feb 2020
Coding problem1

This is a written round on paper for everyone. Three coding questions were given. Two out of three must be correct covering every single edge case to qualify for the next round. Only the most optimal solution was to be considered.

1. Maximum Subarray Sum

Moderate
0/80
Asked in companies
CIS - Cyber InfrastructurePaytm (One97 Communications Limited)Accenture

You are given an array/list ARR consisting of N integers. Your task is to find the maximum possible sum of a non-empty subarray(contagious) of this array.

Note: An array C is a subarray of array D if it can be obtained by deletion of several elements(possibly zero) from the beginning and the end of array D.

For e.g.- All the non-empty subarrays of array [1,2,3] are [1], [2], [3], [1,2], [2,3], [1,2,3].

Try solving now
02
Round
Easy
Face to Face
Duration50 Minutes
Interview date6 Feb 2020
Coding problem1

This was face to face interview round.

1. Triplets in Binary Tree

Easy
15m average time
85% success
0/40
Asked in companies
AmazonPaytm (One97 Communications Limited)Adobe

You have been given a Binary Tree of integers and an integer 'X'. Find all the triplets in the tree whose sum is strictly greater than 'X'. The nodes in the triplet must hold the relationship of grandparent-parent-child.

For example:
For the given binary tree and X = 9

alt text

{1, 3, 6} is a valid triplet because 6 is a node whose parent is 3 and grand-parent is 1. Also, the sum of these nodes is 1 + 3 + 6 = 10 which is strictly greater than X = 9.
Try solving now
03
Round
Easy
Face to Face
Duration60 Minutes
Interview date6 Feb 2020
Coding problem2

FACE TO FACE ROUND INTERVIEW

1. Basic HR Questions

Tell me about yourself.

2. OS Questions

Tell me the diference between Mutex and Semaphores with a real-life example.

Here's your problem of the day

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

Skill covered: Programming

What does HTML stand for?

Choose another skill to practice
Start a Discussion
Similar interview experiences
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by Amazon
1077 views
0 comments
0 upvotes
company logo
SDE - 1
4 rounds | 8 problems
Interviewed by Amazon
1279 views
1 comments
0 upvotes
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by Amazon
539 views
0 comments
0 upvotes
company logo
SDE - 1
4 rounds | 8 problems
Interviewed by Amazon
2037 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
50417 views
5 comments
0 upvotes
company logo
SDE - 1
4 rounds | 8 problems
Interviewed by Samsung
11213 views
2 comments
0 upvotes
company logo
SDE - 1
2 rounds | 4 problems
Interviewed by Google
9845 views
0 comments
0 upvotes