i
Amazon
Proud winner of ABECA 2025 - AmbitionBox Employee Choice Awards
Filter interviews by
Solve a graph traversal problem using recursion, such as finding all paths in a directed graph.
Use Depth-First Search (DFS) for traversal.
Maintain a visited set to avoid cycles.
Base case: if the current node is the target, add the path to results.
Example: For a graph with edges [[0,1],[0,2],[1,3]], find all paths from 0 to 3.
Time management is the process of planning and organizing how to divide your time between specific activities.
Prioritize tasks based on importance and deadlines
Set specific goals and deadlines for each task
Use tools like calendars and to-do lists to stay organized
Avoid multitasking and focus on one task at a time
Allocate time for breaks and relaxation to avoid burnout
My percentage is 85%.
I achieved an 85% overall grade in my last semester.
I consistently maintained an 85% average throughout my academic career.
My performance evaluation rated me at 85% for my work performance.
The Next Greater Element problem involves finding the next greater element for each element in an array.
Use a stack to keep track of elements for which we need to find the next greater element.
Iterate through the array from right to left.
For each element, pop elements from the stack until you find a greater element or the stack is empty.
If the stack is empty, the next greater element is -1; otherwise, it's the top...
What people are saying about Amazon
The House Robber problem involves maximizing loot from houses without robbing adjacent ones.
Dynamic Programming approach is used to solve this problem.
Maintain an array where each index represents the maximum loot up to that house.
For each house, decide to either rob it (add its value to the max loot from two houses back) or skip it (carry forward the max loot from the previous house).
Example: For houses with valu...
I prioritize based on importance and impact, considering both short-term and long-term consequences.
Identify the key factors involved in the tradeoff
Evaluate the potential outcomes of each option
Consider the short-term and long-term implications
Communicate with stakeholders to gather input and perspectives
Make a decision based on the overall impact and importance
Level order traversal visits nodes in a tree level by level, from left to right.
Use a queue to keep track of nodes at each level.
Start with the root node and enqueue it.
While the queue is not empty, dequeue a node, process it, and enqueue its children.
Repeat until all levels are traversed.
Example: For a tree with root 1, left child 2, right child 3, the order is [1, 2, 3].
Find frequency of 2 in sorted array of integers in log(n) time.
Use binary search to find first and last occurrence of 2 in array.
Calculate frequency by subtracting last index from first index and adding 1.
Time complexity is O(log(n)).
Find the maximum frequency integer to the right of each index in an array of numbers.
Create a frequency map of the array.
Iterate through the array and for each index, find the maximum frequency integer to the right using the frequency map.
If there are no integers to the right, return -1.
Reverse a linked list in pairs of three.
Create a function that takes the head of the linked list as input.
Traverse the linked list in pairs of three and reverse each pair.
Update the head of the linked list to the new head after reversing each pair.
Return the new head of the linked list.
MCQs and one question
One medium problem about custom comparators
The House Robber problem involves maximizing loot from houses without robbing adjacent ones.
Dynamic Programming approach is used to solve this problem.
Maintain an array where each index represents the maximum loot up to that house.
For each house, decide to either rob it (add its value to the max loot from two houses back) or skip it (carry forward the max loot from the previous house).
Example: For houses with values [2...
The Next Greater Element problem involves finding the next greater element for each element in an array.
Use a stack to keep track of elements for which we need to find the next greater element.
Iterate through the array from right to left.
For each element, pop elements from the stack until you find a greater element or the stack is empty.
If the stack is empty, the next greater element is -1; otherwise, it's the top of t...
I appeared for an interview in Mar 2025, where I was asked the following questions.
Solve a graph traversal problem using recursion, such as finding all paths in a directed graph.
Use Depth-First Search (DFS) for traversal.
Maintain a visited set to avoid cycles.
Base case: if the current node is the target, add the path to results.
Example: For a graph with edges [[0,1],[0,2],[1,3]], find all paths from 0 to 3.
I applied via Naukri.com and was interviewed in Nov 2024. There was 1 interview round.
It was very basic questions on DSA and Java
I applied via Job Portal
During a group project, we failed to meet our deadline due to poor communication and lack of clear roles among team members.
Lack of Communication: We didn't have regular check-ins, leading to misunderstandings about project requirements.
Undefined Roles: Team members were unclear about their responsibilities, resulting in duplicated efforts and missed tasks.
Time Management Issues: We underestimated the time needed for c...
I prioritize based on importance and impact, considering both short-term and long-term consequences.
Identify the key factors involved in the tradeoff
Evaluate the potential outcomes of each option
Consider the short-term and long-term implications
Communicate with stakeholders to gather input and perspectives
Make a decision based on the overall impact and importance
I appeared for an interview in Jul 2024.
Mcq based test + one coding question
Two coding questions
I applied via Company Website and was interviewed in Jun 2024. There were 2 interview rounds.
Logical, Speed, time and work
Two hard level DSA questions on string, array, Dynamic programming
A question about number theory
Be confident at the interview time
I am a motivated and detail-oriented individual with a passion for learning and problem-solving.
Graduated with a degree in Computer Science
Completed multiple internships in software development
Proficient in programming languages such as Java, Python, and JavaScript
Strong communication and teamwork skills
Interested in exploring new technologies and trends in the industry
Time management is the process of planning and organizing how to divide your time between specific activities.
Prioritize tasks based on importance and deadlines
Set specific goals and deadlines for each task
Use tools like calendars and to-do lists to stay organized
Avoid multitasking and focus on one task at a time
Allocate time for breaks and relaxation to avoid burnout
My strengths include strong communication skills, attention to detail, and ability to work well in a team.
Strong communication skills - able to effectively convey ideas and information
Attention to detail - meticulous in completing tasks accurately
Teamwork - collaborate well with others to achieve common goals
One of my weaknesses is that I can be overly critical of my own work, which can sometimes lead to perfectionism.
I tend to be a perfectionist and can spend too much time on a task to ensure it is flawless.
I struggle with delegating tasks because I want to make sure they are done correctly.
I can be overly self-critical, which can impact my confidence at times.
My percentage is 85%.
I achieved an 85% overall grade in my last semester.
I consistently maintained an 85% average throughout my academic career.
My performance evaluation rated me at 85% for my work performance.
I applied via Indeed and was interviewed in Mar 2024. There were 2 interview rounds.
Harkerrank with golang or java to solve the ds problems
The duration of Amazon Intern interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 20 interview experiences
Difficulty level
Duration
based on 50 reviews
Rating in categories
Hyderabad / Secunderabad
0-3 Yrs
Not Disclosed
Bangalore / Bengaluru
6-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.2 L/yr |
Flipkart
TCS
Netflix