i
Amazon
Proud winner of ABECA 2025 - AmbitionBox Employee Choice Awards
Filter interviews by
Find the mirror node in a binary tree, which is the corresponding node in the mirrored version of the tree.
A mirror node of a binary tree is found by swapping left and right children at each level.
To find a mirror node for a given node, traverse the tree recursively.
Example: For a node with value 5, its mirror node in a mirrored tree would be the node that corresponds to its position in the original tree.
Use depth...
Efficiently find the median in a continuous stream of integers using two heaps.
Use two heaps: a max-heap for the lower half and a min-heap for the upper half.
Insert new numbers into the appropriate heap based on their value.
Balance the heaps to ensure their sizes differ by at most one.
The median is the root of the max-heap if it has more elements, or the average of both roots if they are equal in size.
Example: Str...
Detecting cycles in a directed acyclic graph (DAG) using dynamic programming techniques.
A directed acyclic graph (DAG) has no cycles by definition.
To check for cycles, perform a topological sort.
If a topological sort is possible, the graph is acyclic.
Example: In a graph with edges (1->2, 2->3), topological sort yields [1, 2, 3].
If you encounter a node that is already in the current path, a cycle exists.
Designing a low-level architecture for Uber's ride-sharing platform focusing on key components and interactions.
User Management: Handles user profiles, authentication, and authorization.
Ride Management: Manages ride requests, cancellations, and ride history.
Driver Management: Tracks driver profiles, availability, and ratings.
Geolocation Service: Provides real-time location tracking for users and drivers.
Pricing En...
What people are saying about Amazon
Inorder traversal visits nodes in a binary tree in left-root-right order, useful for sorted output.
Inorder traversal is a depth-first traversal method.
It visits the left subtree, then the root node, and finally the right subtree.
Example: For a tree with root 1, left child 2, and right child 3, the inorder traversal is [2, 1, 3].
It can be implemented recursively or iteratively using a stack.
Inorder traversal of a b...
I improved a product feature decision by analyzing user engagement metrics, leading to a more effective design.
Identified a drop in user engagement metrics for a specific feature.
Conducted A/B testing to compare user interactions with different designs.
Analyzed data showing a 30% increase in engagement with the new design.
Presented findings to the team, leading to a decision to implement the changes.
Design a system for booking tickets for events like movies, concerts, etc.
Use microservices architecture for scalability and flexibility
Implement a user-friendly interface for easy ticket booking
Include features like seat selection, payment gateway integration, and booking history
Utilize a database to store event details, user information, and booking records
BookMyShow is a platform for booking movie tickets, events, and shows, integrating various components for seamless user experience.
User Interface: Intuitive design for easy navigation, showcasing movies, shows, and events.
Search and Filter: Allows users to search for movies by genre, language, or location.
Booking System: Handles ticket selection, seat selection, and payment processing.
Notifications: Sends reminder...
Bitly's design involves components for URL shortening, tracking, and analytics to optimize link management.
URL Shortening: Converts long URLs into short, manageable links (e.g., bit.ly/abc123).
Redirection Service: Handles HTTP requests to redirect users from short links to original URLs.
Analytics Dashboard: Provides insights on link performance, such as click rates and geographic data.
API Integration: Allows devel...
Design system design for bitly
Use a distributed system architecture to handle high traffic and scalability
Implement a URL shortening algorithm to generate unique short links
Utilize caching mechanisms to improve performance and reduce database load
Include analytics and tracking features to monitor link performance
Ensure data security and privacy measures are in place to protect user information
I appeared for an interview in Jun 2025, where I was asked the following questions.
posted on 8 Mar 2025
I appeared for an interview in Feb 2025.
About our role tell about the why u choose this role
posted on 5 Apr 2025
I appeared for an interview in Mar 2025, where I was asked the following questions.
I improved a product feature decision by analyzing user engagement metrics, leading to a more effective design.
Identified a drop in user engagement metrics for a specific feature.
Conducted A/B testing to compare user interactions with different designs.
Analyzed data showing a 30% increase in engagement with the new design.
Presented findings to the team, leading to a decision to implement the changes.
Inorder traversal visits nodes in a binary tree in left-root-right order, useful for sorted output.
Inorder traversal is a depth-first traversal method.
It visits the left subtree, then the root node, and finally the right subtree.
Example: For a tree with root 1, left child 2, and right child 3, the inorder traversal is [2, 1, 3].
It can be implemented recursively or iteratively using a stack.
Inorder traversal of a binary...
I appeared for an interview in Mar 2025, where I was asked the following questions.
Designing a low-level architecture for Uber's ride-sharing platform focusing on key components and interactions.
User Management: Handles user profiles, authentication, and authorization.
Ride Management: Manages ride requests, cancellations, and ride history.
Driver Management: Tracks driver profiles, availability, and ratings.
Geolocation Service: Provides real-time location tracking for users and drivers.
Pricing Engine:...
Detecting cycles in a directed acyclic graph (DAG) using dynamic programming techniques.
A directed acyclic graph (DAG) has no cycles by definition.
To check for cycles, perform a topological sort.
If a topological sort is possible, the graph is acyclic.
Example: In a graph with edges (1->2, 2->3), topological sort yields [1, 2, 3].
If you encounter a node that is already in the current path, a cycle exists.
Ds and Algo, tree, array String
DS Algo, Tree Array grapH String
1hr with two DSA questions, one is printing nth row of pascal triangle,
other I donot remember
Diagonal traversal of a binary tree involves printing the nodes of the tree in a diagonal pattern.
Start with the root node and move to its right child, then move down to its left child.
Repeat this process for each diagonal of the tree, printing the nodes as you traverse.
Use a queue to keep track of the nodes at each level of the tree.
Find the merge point of two linked lists.
Traverse both linked lists to find their lengths.
Calculate the difference in lengths and move the pointer of the longer list by the difference.
Traverse both lists in parallel until the merge point is found.
DSA and SQL leetcode questions
Standard DS/Algo involving mostly trees and leadership principles
Design a hotel management system to handle bookings, check-ins, and customer services efficiently.
User authentication: Allow users to create accounts and log in to manage bookings.
Room management: Track room availability, types, and pricing (e.g., single, double, suite).
Booking system: Implement a calendar for checking availability and making reservations.
Payment processing: Integrate secure payment gateways for online...
I applied via Approached by Company and was interviewed in May 2024. There were 2 interview rounds.
Hackerrank 2 questions followed by leadership principle questions
Some of the top questions asked at the Amazon Software Development Engineer interview -
The duration of Amazon Software Development Engineer interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 36 interview experiences
Difficulty level
Duration
based on 141 reviews
Rating in categories
Hyderabad / Secunderabad
5-8 Yrs
₹ 5.5-42 LPA
Customer Service Associate
4k
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 |
Program Manager
2.2k
salaries
| ₹16.6 L/yr - ₹28 L/yr |
Flipkart
TCS
Netflix