i
Amazon
Proud winner of ABECA 2025 - AmbitionBox Employee Choice Awards
Filter interviews by
Design a valet parking lot with ticket assignment and car retrieval using best fit and nearest distance.
Create a parking lot with designated spots for each size of car
Assign a ticket to the customer upon entry and record the spot number
Retrieve the car by searching for the nearest available spot of the appropriate size
Use best fit algorithm to minimize empty spots
Implement a system for payment upon exit
Arrange nuts and bolts so that every nut fits perfectly with the bolt in the same position.
Sort both arrays in the same order using a comparison function
Use a binary search to find the matching bolt for each nut
Repeat until all nuts are matched with bolts
The program counts the number of tree structures that can be made using n nodes.
Use dynamic programming to solve the problem efficiently
Break down the problem into subproblems and store their solutions in an array
Iterate through the array to calculate the number of tree structures
The time complexity of the program is O(n^2)
The longest continuous patch of a road being repaired by a contractor is determined.
Iterate through the updates and keep track of the start and end points of each patch
Calculate the length of each patch and update the longest patch if necessary
Return the start and end points of the longest patch
What people are saying about Amazon
Measure the time from typing a URL to page load using network requests and timestamps.
Use browser developer tools to monitor network requests and timestamps.
Implement a JavaScript function to capture the time when the URL is entered.
Send a dummy request after the page load to measure response time.
Utilize performance APIs like 'performance.now()' for precise timing.
Log the time taken for DNS resolution, TCP connec...
Implementing a Least Recently Used (LRU) Cache using a combination of a doubly linked list and a hash map for O(1) access.
Use a hash map to store key-value pairs for O(1) access.
Maintain a doubly linked list to track the order of usage.
When accessing an item, move it to the front of the list.
When adding a new item, check if the cache is full; if so, remove the least recently used item from the back of the list.
Exa...
Graphs are non-linear data structures with cycles while trees are hierarchical data structures without cycles.
Graphs can have cycles while trees cannot
Graphs can have multiple root nodes while trees have only one
Graphs can have disconnected components while trees are always connected
Graphs can have directed or undirected edges while trees have only directed edges
Examples of graphs include social networks, road net...
A tree is a data structure consisting of nodes connected by edges, with a single root node and no cycles.
Nodes represent elements of the tree, and edges represent the relationships between them.
Each node can have zero or more child nodes, and each child node can have its own children.
Trees are commonly used in computer science for organizing and searching data, such as in binary search trees.
Examples of trees incl...
A graph can be called a tree if it is connected and has no cycles.
A tree is a type of graph with no cycles.
It must be connected, meaning there is a path between any two vertices.
It has n-1 edges, where n is the number of vertices.
Examples include family trees, file directory structures, and decision trees.
Design a system using Max Heap to find the costliest element from a box when an element is picked.
Implement a Max Heap data structure to store the elements in the box.
Whenever an element is picked, the costliest element can be found at the root of the Max Heap.
After picking an element, update the Max Heap by removing the root and reorganizing the heap.
Ensure the Max Heap property is maintained during insertion and...
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
| ₹1.8 L/yr - ₹5 L/yr |
Transaction Risk Investigator
3.1k
salaries
| ₹2.9 L/yr - ₹6.5 L/yr |
Associate
3.1k
salaries
| ₹2 L/yr - ₹5.5 L/yr |
Senior Associate
2.6k
salaries
| ₹4 L/yr - ₹9 L/yr |
Software Developer
2.3k
salaries
| ₹25.3 L/yr - ₹44 L/yr |
Flipkart
TCS
Netflix