i
Amazon
Proud winner of ABECA 2025 - AmbitionBox Employee Choice Awards
Filter interviews by
Remove characters from string A that appear in string B, considering their frequency in B.
Use a frequency counter for string B to track occurrences of each character.
Iterate through string A and build a new string excluding characters found in B.
Example: A = 'hello', B = 'l' -> Result: 'heo'.
Example: A = 'banana', B = 'an' -> Result: 'b'.
Consider edge cases like empty strings or no common characters.
Find a number in a consecutive integer array using binary search for optimal time complexity.
The array is sorted and consists of consecutive integers, e.g., [1, 2, 3, 4, 5].
Use binary search to find the number in O(log n) time complexity.
Calculate the mid index and compare the middle element with the target.
If the target is less than the middle element, search the left half; otherwise, search the right half.
Exampl...
Use a min-heap to efficiently find the m closest points to an origin in a coordinate system.
1. Use a min-heap (priority queue) to store points based on their distance from the origin.
2. Calculate the distance using the Euclidean formula: distance = sqrt((x2 - x1)^2 + (y2 - y1)^2).
3. Insert points into the heap and maintain its size to m to keep only the closest points.
4. Example: For points (1,2), (3,4), (5,6) and...
Implementing caching, optimizing queries, and using CDNs can reduce latency when accessing data from social networking sites.
Use caching mechanisms like Redis or Memcached to store frequently accessed data.
Optimize database queries to reduce response time, e.g., using indexes.
Implement pagination to load data in chunks instead of all at once.
Utilize Content Delivery Networks (CDNs) to serve static assets closer to...
What people are saying about Amazon
Validate user passwords against predefined conditions to ensure security and compliance.
Password must be at least 8 characters long. Example: 'Password1' is valid, 'Pass' is invalid.
Password must contain at least one uppercase letter. Example: 'Password1' is valid, 'password1' is invalid.
Password must contain at least one lowercase letter. Example: 'Password1' is valid, 'PASSWORD1' is invalid.
Password must include...
The given question asks to replace the value in each node of a binary search tree with the sum of all nodes greater than the current node.
Traverse the BST in reverse order (right, root, left)
Keep track of the sum of all greater nodes encountered so far
Update the value of each node with the sum and update the sum
The remaining memory is not wasted, but reserved for other system processes and applications.
The operating system reserves a portion of the RAM for its own processes and functions.
The unused memory can be used for caching data, improving system performance.
Applications and processes may not require the full amount of RAM at all times.
The unused memory can be allocated to other applications when needed.
Virtual memo...
To identify if a tree is a BST, check if the inorder traversal of the tree results in a sorted sequence.
Perform an inorder traversal of the tree
Check if the resulting sequence is sorted in ascending order
If yes, the tree is a BST; otherwise, it is not
Use file locking mechanism to ensure mutual exclusion.
Implement file locking mechanism to prevent simultaneous access to files.
Use semaphores or mutexes to ensure only one process can access a file at a time.
Implement a queue system to handle multiple requests and process them one by one.
Use transactional file systems to ensure atomicity of file operations.
Implement a timeout mechanism to prevent deadlocks.
Conside...
Implementing a hash table in code
Choose a hash function to map keys to indices in the table
Create an array to hold the values at each index
Handle collisions by using a collision resolution strategy
Implement methods for inserting, retrieving, and deleting values
Consider load factor and resizing the table if necessary
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.2k
salaries
| ₹1.8 L/yr - ₹5 L/yr |
Transaction Risk Investigator
3.1k
salaries
| ₹2.4 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
| ₹22.9 L/yr - ₹42.8 L/yr |
Flipkart
TCS
Netflix