i
Amazon
Proud winner of ABECA 2025 - AmbitionBox Employee Choice Awards
Filter interviews by
Reversing two halves of a linked list problem
Identify input and output linked lists
Reverse the two halves of the input linked list
Compare the reversed input linked list with the output linked list
If they match, return true else false
Find total possible valid unique combinations of given number of pairs of parenthesis without duplicity.
Use recursion to generate all possible combinations
Check for validity of each combination using a stack
Use a set to avoid duplicity
Construct a binary tree from in-order traversal with nodes greater than left and right child.
The root node will be the maximum value in the in-order traversal
Recursively construct the left and right subtrees using the left and right portions of the in-order traversal
Repeat until all nodes are added to the tree
An algorithm to find top 10 trending words inserted by users in sites like Twitter.
Collect a large dataset of tweets
Tokenize the tweets into individual words
Remove stop words and punctuation
Count the frequency of each word
Sort the words by frequency in descending order
Select the top 10 words
What people are saying about Amazon
Find the first occurrence of 1 in a sorted infinite binary tree.
Use binary search to traverse the tree.
If the current node is 1, check if its left child is also 1. If yes, move to the left subtree, else return the current node.
If the current node is 0, move to the right subtree.
Repeat until the first occurrence of 1 is found or the tree is exhausted.
Remove duplicates from a string in O(n) without using hash
Use an array of boolean values to keep track of characters already seen
Iterate through the string and mark characters as seen in the array
If a character has already been seen, remove it from the string
Find the first occurrence of 1 in a sorted binary array.
Use binary search to find the first occurrence of 1.
If the mid element is 1, check if it's the first occurrence or if the element before it is 0.
If the mid element is 0, search in the right half of the array.
If the mid element is 1 and the element before it is also 1, search in the left half of the array.
Modify a binary tree's random pointers to point to NULL if they don't point to a successor node.
Traverse the binary tree using DFS or BFS.
For each node, check if the random pointer points to a valid successor.
If it points to a node that is not a successor, set it to NULL.
A successor of a node is defined as its children or their descendants.
Populate sibling of a tree node with next node in same level with O(1) space complexity.
Traverse the tree level by level using BFS.
For each node, check if it has a sibling to its right.
If yes, populate the sibling pointer of the current node with the right sibling.
If no, move to the next level.
Repeat until all levels are traversed.
Construct a mirror tree from a given tree and return the root of the mirror tree.
Traverse the given tree in a recursive manner.
Swap the left and right child of each node.
Return the root of the mirror tree.
I applied via Referral and was interviewed in Dec 2024. There were 2 interview rounds.
OA consisted of two DSA questions.
I applied via LinkedIn and was interviewed in Nov 2024. There were 3 interview rounds.
Simple Normal DSA Question
Focus on DSA and optimization
Project Discussion and some Date structure questions
Good DSA Questions
Recursion, Graph and Tree
I applied via Company Website and was interviewed in Aug 2024. There were 2 interview rounds.
There are two straightforward data structure and algorithm questions, while the others primarily consist of multiple-choice questions, mostly focusing on nodes and Python.
In the telephonic round, they primarily assess your problem-solving skills. The interviewer asked me a binary search question, which I was able to solve, but it took me a considerable amount of time to arrive at the solution. This was likely the main reason for my rejection.
I applied via Naukri.com and was interviewed in Sep 2024. There was 1 interview round.
Find the order of excecution in sql
I applied via LinkedIn and was interviewed in Nov 2024. There was 1 interview round.
It was a one hour DS Algo Round based on recursion and DP. I managed to get to the logic for the problem but couldn't execute compltely due to time constraints
I applied via Naukri.com and was interviewed in May 2024. There were 2 interview rounds.
HACKER RANK TEST WITH MEDIUM LEVEL QUESTIONS
A linked list is a data structure consisting of nodes where each node points to the next node in the sequence.
Create a Node class with data and next pointer
Initialize a head pointer to null
Add nodes by updating next pointers
To find a loop in a linked list, use Floyd's Tortoise and Hare algorithm.
Use two pointers, slow and fast, to traverse the linked list.
If there is a loop, the two pointers will eventually meet at the same node.
To find the start of the loop, reset one pointer to the head and move both pointers at the same pace.
I applied via Company Website and was interviewed in Jul 2024. There were 5 interview rounds.
SLiding window problem
Tree problem variation
DP Problems same questions but with different cases
I worked at a tech startup where I developed web applications and implemented new features.
Led a team of developers to successfully launch a new mobile app
Implemented a new payment gateway system to improve user experience
Collaborated with product managers to prioritize and deliver features on time
I handle pressure by staying organized, prioritizing tasks, and taking breaks when needed.
I prioritize tasks based on deadlines and importance
I break down large tasks into smaller, manageable steps
I communicate with team members or supervisors if feeling overwhelmed
I practice mindfulness techniques like deep breathing or meditation to stay calm
Some of the top questions asked at the Amazon SDE interview -
The duration of Amazon SDE interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 35 interview experiences
Difficulty level
Duration
based on 26 reviews
Rating in categories
Customer Service Associate
4.1k
salaries
| ₹0.6 L/yr - ₹7.8 L/yr |
Transaction Risk Investigator
3.1k
salaries
| ₹2 L/yr - ₹6.3 L/yr |
Associate
3k
salaries
| ₹0.8 L/yr - ₹7 L/yr |
Senior Associate
2.6k
salaries
| ₹1.8 L/yr - ₹9 L/yr |
Software Developer
2.2k
salaries
| ₹27.1 L/yr - ₹56.3 L/yr |
Flipkart
TCS
Netflix