AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
Amazon
Compare
Proud winner of ABECA 2025 - AmbitionBox Employee Choice Awards
Filter interviews by
Amazon SDE Interview Questions and Answers
52 Interview questions
Construct a binary tree using given preorder and postorder traversals.
Preorder traversal: Root -> Left -> Right.
Postorder traversal: Left -> Right -> Root.
The first element of preorder is the root of the tree.
The last element of postorder is also the root of the tree.
To build the tree, recursively find left and right subtrees.
Example: Preorder: [A, B, D, E, C] and Postorder: [D, E, B, C, A] forms a tre...
Find two numbers in an array that add up to a specific target sum.
Use a hash map to store numbers and their indices for quick lookup.
Iterate through the array, calculating the complement for each number.
Example: For nums = [2, 7, 11, 15] and target = 9, return indices [0, 1].
Time complexity is O(n) due to single pass through the array.
Combine ropes to minimize cost by always combining the two shortest ropes
Sort the ropes in ascending order
Combine the two shortest ropes at each step
Update the cost and add the new combined rope back to the list
Repeat until only one rope is left
Calculate the amount of water that can be trapped between elevation bars after rainfall.
Use two pointers to traverse the height array from both ends.
Maintain left and right max heights to calculate trapped water.
Example: For heights [0,1,0,2,1,0,1,3,2,1,2,1], the trapped water is 6.
What people are saying about Amazon
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.
BigO of OA refers to the time complexity analysis of the algorithm OA.
BigO notation is used to describe the worst-case time complexity of an algorithm.
It provides an upper bound on the growth rate of the algorithm's time complexity as the input size increases.
For example, if an algorithm has a time complexity of O(n^2), it means that the algorithm's running time grows quadratically with the input size.
An LRU cache efficiently stores a limited number of items, evicting the least recently used when full.
LRU stands for Least Recently Used, a cache eviction policy.
It maintains a fixed size and removes the least recently accessed item when full.
Commonly implemented using a combination of a hash map and a doubly linked list.
Example: If a cache size is 2 and items 1, 2, 3 are accessed, 1 and 2 are stored, then 3 evict...
Spring is immutable
Spring framework is immutable
Once a Spring bean is created, its state cannot be changed
Any modifications to a Spring bean result in a new instance being created
Modified Knapsack problem
Similar to Knapsack problem, but with additional constraints or modifications
May involve multiple knapsacks or fractional items
Examples include 0/1 Knapsack with profit and weight limits, bounded Knapsack with item quantity limits
Amazon SDE Interview Experiences
44 interviews found
Anonymous
Selected
I applied via Referral and was interviewed in Dec 2024. There were 2 interview rounds.
OA consisted of two DSA questions.
(1 Question)
- Q1. Was asked dsa based questions.
Vijayalakshmi Chidambaram
(2 Questions)
- Q1. General behavioral kinda questions on my last project
- Q2. LLD question where coding in 30 mins
Selected
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
Interview Preparation Tips
Selected
Good DSA Questions
Recursion, Graph and Tree
I applied via Company Website and was interviewed in Aug 2024. There were 2 interview rounds.
(2 Questions)
- Q1. String pattern matching
- Q2. Behavioral questions
(2 Questions)
- Q1. Behavioral questions
- Q2. BFS file system
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.
Aryan Verma
Selected
I applied via Naukri.com and was interviewed in Sep 2024. There was 1 interview round.
Find the order of excecution in sql
Interview Preparation Tips
Yatharth Singh
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
(3 Questions)
- Q1. CREATE A LINKED LIST
- Ans.
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
- Q2. FIND THE LOOP IN LINKED LIST
- Ans.
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.
- Q3. QUESTION BASED ON DYNAMIC PROGRAMMING
Interview Preparation Tips
- Data Structures
- Algorithms
- Java
Skills evaluated in this interview
Selected
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
(2 Questions)
- Q1. Experience with last company
- Ans.
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
- Q2. How you handle pressure
- Ans.
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
(1 Question)
- Q1. Behavioural ROund
Amazon Interview FAQs
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.
Tell us how to improve this page.
Amazon Interviews By Designations
- Amazon Software Developer Interview Questions
- Amazon Customer Service Associate Interview Questions
- Amazon Customer Service Executive Interview Questions
- Amazon Transaction Risk Investigator Interview Questions
- Amazon Software Developer Intern Interview Questions
- Amazon Associate Interview Questions
- Amazon Seller Support Associate Interview Questions
- Amazon Software Engineer Interview Questions
- Show more
Overall Interview Experience Rating
based on 35 interview experiences
Difficulty level
Duration
Interview Questions from Similar Companies
Amazon SDE Reviews and Ratings
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
- Home >
- Interviews >
- Amazon Interview Questions
