i
Amazon
Proud winner of ABECA 2025 - AmbitionBox Employee Choice Awards
Filter interviews by
Generate all possible parentheses for a given integer n.
Use recursion to generate all possible combinations of parentheses.
Start with an empty string and keep adding opening and closing parentheses.
Keep track of the number of opening and closing parentheses used.
Stop recursion when the number of opening and closing parentheses reaches n.
Add the generated combination to the result array.
To find a loop in a linked list, we can use the Floyd's cycle-finding algorithm.
Initialize two pointers, slow and fast, both pointing to the head of the linked list.
Move slow pointer by one step and fast pointer by two steps at each iteration.
If there is a loop, the slow and fast pointers will eventually meet.
To prove the algorithm, we can use mathematical induction and the concept of tortoise and hare.
Spiral order traversal of a binary tree
Use a stack and a queue to traverse the binary tree in a spiral order
Start with the root node and add it to the stack
While the stack is not empty, pop a node from the stack and add its children to the queue
If the stack is empty, swap the stack and queue
Repeat until both stack and queue are empty
The question asks how to feed a 2D matrix with values based on the given binary tree.
Traverse the binary tree and for each node, update the corresponding row in the matrix
Use a recursive function to update the matrix values
Start with the root node and recursively update its descendants
Set M[i, j] to 1 if node i is an ancestor of node j
Repeat the process for all nodes in the binary tree
What people are saying about Amazon
Find the first occurrence of a given key element in a sorted array with duplicates.
Use binary search to find the key element.
If the key element is found, check if it is the first occurrence by checking the previous element.
If the key element is not found, return -1.
Deploy minimum guards on a city's road network ensuring each road has at least one guard at its ends.
Model the city as a graph where intersections are nodes and roads are edges.
Use a greedy algorithm to select nodes (intersections) to place guards.
A possible approach is to use a vertex cover algorithm, which finds the smallest set of vertices covering all edges.
For example, in a triangle graph with edges (1,2), (2...
Create a deep copy of a linked list with next and random pointers.
Traverse the original list and create a copy of each node.
Insert the copied nodes right next to the original nodes.
Set the random pointers of the copied nodes using the original nodes' random pointers.
Separate the copied list from the original list.
Rotated arrays can be solved using binary search or linear search to find the minimum element or search for a target.
Identify the pivot point where the array is rotated. Example: [4, 5, 6, 7, 0, 1, 2] is rotated at index 3.
Use binary search to find the target efficiently. If the middle element is greater than the first element, search the left half.
If the middle element is less than the first element, search the r...
Use file locking mechanisms like flock or lockfile to make a file mutually exclusive on a shared file system.
Use flock or lockfile to acquire a lock on the file before accessing it.
Release the lock once the operation is complete.
Ensure all processes accessing the file use the same locking mechanism.
Example: flock /path/to/file -c 'command to execute'
Example: lockfile /path/to/file && command to execute && rm -f /p...
Algorithm to find the best buying and selling dates for maximum profit from given stock prices array.
Iterate through the array and keep track of minimum price and maximum profit.
If current price is less than minimum price, update minimum price.
If current price minus minimum price is greater than maximum profit, update maximum profit and buying and selling dates.
Return buying and selling dates.
Example: [10, 7, 5, 8...
I appeared for an interview in Feb 2025.
Coding questions about our technical skills
I applied via Company Website and was interviewed in Nov 2024. There was 1 interview round.
Amazon offers challenging projects, innovative technologies, and a collaborative work environment.
Opportunity to work on cutting-edge projects like Amazon Web Services (AWS) or Alexa
Access to vast resources and tools for development
Collaborative work culture that encourages learning and growth
Opportunity to impact millions of customers worldwide
Competitive compensation and benefits package
I want to work at Amazon because of their innovative culture, vast resources, and opportunities for growth.
Amazon is known for its innovative culture and cutting-edge technology.
They have vast resources and a global reach, providing opportunities to work on impactful projects.
Amazon offers great career growth and development opportunities for software developers.
I admire Amazon's customer-centric approach and focus on ...
My strengths include problem-solving skills and attention to detail. My weakness is sometimes being too critical of my own work.
Strengths: problem-solving skills
Strengths: attention to detail
Weakness: being too critical of my own work
I would solve the problem by breaking it down into smaller tasks, analyzing requirements, designing a solution, coding, testing, and debugging.
Analyze requirements thoroughly before starting the development process
Break down the problem into smaller tasks to make it more manageable
Design a solution architecture that meets the requirements and is scalable
Code the solution using best practices and coding standards
Test th...
Short term goals focus on immediate tasks and objectives, while long-term goals involve strategic planning and growth.
Short term goals may include completing a specific project, improving team communication, or implementing a new software feature.
Long-term goals could involve expanding the team, increasing market share, or developing new products or services.
Short term goals help keep the team focused and motivated, wh...
I applied via Company Website and was interviewed in Jun 2024. There were 6 interview rounds.
It was a coding test on Hackerrank with 3 Leetcode easy to medium-level questions.
I applied via Campus Placement and was interviewed in Nov 2024. There were 3 interview rounds.
Good but tough i dint do well but still qualified
Very tough only graphs dp and linked lists were asked
Depth-first search (DFS) is a graph traversal algorithm that explores as far as possible along each branch before backtracking.
DFS starts at a selected node and explores as far as possible along each branch before backtracking.
It uses a stack to keep track of nodes to visit next.
DFS can be implemented recursively or iteratively.
Example: DFS traversal of a graph starting from node A: A -> B -> D -> E -> C -&...
Use Dijkstra's algorithm to find the smallest path from point a to point b in a matrix.
Implement Dijkstra's algorithm to find the shortest path in a matrix
Create a matrix representation of the graph with weights on edges
Start from point a and explore all possible paths to reach point b
Hacker rank test include 2 code and mcg questions
Linked lists are dynamic data structures that consist of nodes, each containing data and a reference to the next node.
A linked list consists of nodes, where each node has data and a pointer to the next node.
Types of linked lists include singly linked lists, doubly linked lists, and circular linked lists.
Example of a singly linked list: Node1 -> Node2 -> Node3 -> NULL.
Doubly linked list allows traversal in both...
Two coding questions, both passed 100%
Identifying duplicates in an array involves finding and removing elements that appear more than once.
Iterate through the array and use a hash set to keep track of elements seen so far.
If an element is already in the hash set, it is a duplicate and can be removed.
Example: ['apple', 'banana', 'apple', 'orange'] - 'apple' is a duplicate.
Example: ['cat', 'dog', 'bird', 'cat'] - 'cat' is a duplicate.
2-3 coding questions with some mcq
I appeared for an interview in Apr 2025, where I was asked the following questions.
Design a data structure for O(1) create/delete and random number generation using a hash map and an array.
Use a hash map to store elements with their indices for O(1) access.
Maintain an array to store the actual elements for O(1) random access.
On insertion, add the element to the array and update the hash map.
On deletion, swap the element with the last element in the array, remove it, and update the hash map.
To get a r...
I appeared for an interview in May 2025, where I was asked the following questions.
Some of the top questions asked at the Amazon Software Developer interview -
The duration of Amazon Software Developer interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 131 interview experiences
Difficulty level
Duration
based on 272 reviews
Rating in categories
Bangalore / Bengaluru
5-10 Yrs
Not Disclosed
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.3k
salaries
| ₹24.8 L/yr - ₹44 L/yr |
Flipkart
TCS
Netflix