i
Amazon
Proud winner of ABECA 2025 - AmbitionBox Employee Choice Awards
Filter interviews by
Sorting a list of words with a random order using an alien dictionary
Create a graph with nodes as characters and edges as the order of characters in words
Topologically sort the graph to get the correct order of characters
Use the order to sort the list of words
Implement a binary search algorithm with edge case handling for efficient searching in a sorted array.
Binary search works on sorted arrays. Example: [1, 2, 3, 4, 5]
Check if the array is empty before searching. Example: []
Handle cases where the target is not found. Example: Searching for 6 in [1, 2, 3, 4, 5]
Consider edge cases for the first and last elements. Example: Searching for 1 or 5 in [1, 2, 3, 4, 5]
Return t...
Merge overlapping intervals
Sort the intervals based on their start time
Iterate through the intervals and merge overlapping ones
Return the merged intervals
Program to find all sibling nodes of a BST
Traverse the BST and keep track of parent node
If a node has the same parent as another node, they are siblings
Recursively check left and right subtrees
Use a queue or stack to implement level order traversal
What people are saying about Amazon
Yes, high and low level design principles are important in software development.
High level design principles focus on overall architecture and system organization.
Low level design principles focus on implementation details and code structure.
Examples of high level design principles include SOLID, DRY, and KISS.
Examples of low level design principles include naming conventions, code commenting, and code formatting.
...
Convert an expression to post-fix notation.
Start with an empty stack.
Scan the expression from left to right.
If the scanned character is an operand, output it.
If the scanned character is an operator, pop two operands from stack, output them in post-fix notation and push the result back.
Repeat until the end of expression.
Find the maximum continuous sum in an array of integers.
Use Kadane's algorithm to find the maximum subarray sum in linear time complexity.
Initialize two variables, one for current maximum sum and another for overall maximum sum.
Iterate through the array and update the variables accordingly.
Example: For array [-2, 1, -3, 4, -1, 2, 1, -5, 4], the maximum continuous sum is 6 (from index 3 to 6).
Implement binary search in a semi-infinite array.
Start with the first element and keep doubling the index until the target element is less than the current element.
Perform binary search on the subarray from the last doubled index to the current index.
If the target element is not found, repeat the process by doubling the last index and searching again.
Handle edge cases where the target element is at the first index...
Find maximum of every window of size K in an array
Iterate through the array and maintain a deque of indices of elements in the current window
Remove indices from the front of the deque if they are outside the current window
Remove indices from the back of the deque if their corresponding elements are smaller than the current element
The front of the deque will always contain the index of the maximum element in the cu...
Program to calculate sum of level order tree
Traverse the tree level by level using BFS
Add the values of each level and return the sum
Use a queue to store the nodes at each level
Handle edge cases like empty tree or null root
I applied via Approached by Company and was interviewed in Feb 2023. There were 5 interview rounds.
60 mins, 2 Coding questions general Leetcode medium ones
Sorting a list of words with a random order using an alien dictionary
Create a graph with nodes as characters and edges as the order of characters in words
Topologically sort the graph to get the correct order of characters
Use the order to sort the list of words
Implement a binary search algorithm with edge case handling for efficient searching in a sorted array.
Binary search works on sorted arrays. Example: [1, 2, 3, 4, 5]
Check if the array is empty before searching. Example: []
Handle cases where the target is not found. Example: Searching for 6 in [1, 2, 3, 4, 5]
Consider edge cases for the first and last elements. Example: Searching for 1 or 5 in [1, 2, 3, 4, 5]
Return the in...
I applied via Company Website and was interviewed in Oct 2022. There were 3 interview rounds.
2 CODING QUESTIONS IN ONE HOIR TIME DURATION
Interview question on bit manipulation and basic dynamic programming
Be familiar with bitwise operators like AND, OR, XOR, and bit shifting
Understand how to use bit manipulation to solve problems like counting set bits or checking if a number is a power of 2
For dynamic programming, break down the problem into smaller subproblems and use memoization or tabulation to avoid redundant calculations
Practice solving coding pro...
I applied via Campus Placement and was interviewed in Aug 2022. There were 2 interview rounds.
1 hr, 2 questions, Arrays prefix sum and slide window, Greedy and DP.
I applied via Company Website and was interviewed in May 2022. There were 3 interview rounds.
Coding test had 3 questions of medium to hard difficulty level, also has MCQ to find right answer
Questions related to oops and binary tree (leetcode medium)
Merge overlapping intervals
Sort the intervals based on their start time
Iterate through the intervals and merge overlapping ones
Return the merged intervals
I applied via Referral and was interviewed in Jan 2022. There were 3 interview rounds.
1. Two Leetcode medium Level Questions
2. First one was based on Strings manipulation, hashmaps.
3. Second one was based on DFS/BFS.
Easy questions both were from string concept
posted on 11 Jun 2022
I applied via Naukri.com and was interviewed in Jul 2022. There were 3 interview rounds.
They asked you near by30 apptitude question
ARITHMETIC GPRAHICDesigner
I applied via LinkedIn and was interviewed in Feb 2022. There was 1 interview round.
Program to find all sibling nodes of a BST
Traverse the BST and keep track of parent node
If a node has the same parent as another node, they are siblings
Recursively check left and right subtrees
Use a queue or stack to implement level order traversal
Some of the top questions asked at the Amazon SDE (Software Development Engineer) interview -
based on 2 interview experiences
Difficulty level
Duration
based on 69 reviews
Rating in categories
Customer Service Associate
4.1k
salaries
| ₹0.6 L/yr - ₹8 L/yr |
Transaction Risk Investigator
3.1k
salaries
| ₹2 L/yr - ₹6.5 L/yr |
Associate
3.1k
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