AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
Amazon
Compare
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Amazon Software Developer Interview Questions, Process, and Tips
Top Amazon Software Developer Interview Questions and Answers
- Q1. Maximum Subarray Sum Problem Statement Given an array of integers, determine the maximum possible sum of any contiguous subarray within the array. Example: Input: array ...read more
- Q2. Minimum Number of Platforms Needed Problem Statement You are given the arrival and departure times of N trains at a railway station for a particular day. Your task is to ...read more
- Q3. Fenwick Tree Problem Statement You are provided with an array/list ARR consisting of 'N' integers, along with 'Q' queries. Each query can be of one of the following two ...read more
Amazon Software Developer Interview Experiences
186 interviews found
Anonymous
Interview Questionnaire
10 Questions
- Q1. Find sum of all numbers that are formed from root to leaf path (code) expected time complexity O(n)
- Ans.
The question asks to find the sum of all numbers formed from root to leaf path in a tree.
Traverse the tree using depth-first search (DFS)
At each node, calculate the number formed by concatenating the current number with the node's value
If the node is a leaf, add the formed number to the sum
Return the sum as the result
- Q2. Given a string you need to print all possible strings that can be made by placing spaces (zero or one) in between them. For example : ABC -> A BC, AB C, ABC, A B C
- Ans.
Print all possible strings by placing spaces (zero or one) in between given string.
Use recursion to generate all possible combinations.
For each character, either include it with a space or without a space.
Stop recursion when all characters have been processed.
Print all generated combinations.
- Q3. Preorder traversal without using recursion
- Ans.
Preorder traversal without recursion is done using a stack to simulate the recursive function calls.
Create an empty stack and push the root node onto it
While the stack is not empty, pop a node from the stack and visit it
Push the right child of the popped node onto the stack
Push the left child of the popped node onto the stack
- Q4. There is a 12 km road and a contractor who is in-charge of repairing it. Contractor updates you about the work which is done in patches. Like “Road between 3.2 km to 7.9 km repaired ”, “Road between 1.21 k...
- Ans.
The longest continuous patch of a road 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
- Q5. Several Questions were asked from my project
- Q6. Find median of an unsorted array. (code)
- Ans.
Find median of an unsorted array.
Sort the array in ascending order
If the array has an odd length, the median is the middle element
If the array has an even length, the median is the average of the two middle elements
- Q7. General discussion on heaps
- Q8. A stream of characters is coming, at any moment you have to tell ‘k’ elements closest to a given number (code)
- Ans.
The code should find the 'k' elements closest to a given number from a stream of characters.
Use a priority queue to keep track of the 'k' closest elements.
For each character in the stream, calculate its distance from the given number and add it to the priority queue.
If the priority queue size exceeds 'k', remove the element with the maximum distance.
At any moment, the 'k' elements in the priority queue will be the clos
- Q9. Design data structure that supports insert(), remove(), find-max(), delete-max() operations. All operations should run in O(1) time. Lots of discussion was there, discussed many approaches
- Ans.
Design a data structure with O(1) insert(), remove(), find-max(), delete-max() operations.
Use a doubly linked list to store the elements and a hash table to store the pointers to the nodes.
Keep track of the maximum element in a separate variable and update it on insert() and delete-max() operations.
For remove() operation, use the hash table to find the node and remove it from the linked list.
All operations should be im
- Q10. Check whether given link list represents palindrome
- Ans.
Check if a given linked list is a palindrome.
Traverse the linked list and push each element onto a stack.
Traverse the linked list again and compare each element with the top of the stack.
If all elements match, the linked list is a palindrome.
Alternatively, reverse the linked list and compare it with the original linked list.
Interview Preparation Tips
College Name: NA
Skills evaluated in this interview
I applied via Company Website and was interviewed in Nov 2024. There was 1 interview round.
(5 Questions)
- Q1. Why Amazon Software Developer?
- Ans.
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
- Q2. Why do you want to work at amazon ?
- Ans.
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
- Q3. What are your strengths and weakness?
- Ans.
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
- Q4. How would you solve?
- Ans.
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...
- Q5. What are the short term and long-term for teame or organisation?
- Ans.
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...
Interview Preparation Tips
- Excel
- Data Entry
- Project Management
- Ms World
- Programming
- Google software developer
- Microsoft software developer
1. Understand Amazon's culture:?
2. Review job description ?
3.update your resume.? B
INTERVIEW PREPARATION
1.Research the team and role ?
2. Prepare to talk about your experience?
3.How would you solve?
4.What are your strengths and weakness?
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.
(1 Question)
- Q1. Phone Interview Round - LP-based discussion followed by an easy DSA question.
(1 Question)
- Q1. Loop Round 1 (Hiring Manager Round) - LP-based discussion followed by a system design question (HLD) which was basically around what the hiring team is working on.
(1 Question)
- Q1. Loop Round 2 (Coding Round) - LP-based discussion followed by a Leetcode medium coding question.
(1 Question)
- Q1. Loop Round 3 (Coding Round) - LP-based discussion followed by an OOD question which was fairly simple but the requirements were not clarified very well even on asking multiple times. Ask and clarify to the...
(1 Question)
- Q1. Loop Round 4 (Coding Round) (Bar Raiser) - LP-based discussion followed by a Leetcode medium coding question.
Interview Preparation Tips
- Data Structures
- Algorithms
- System Design
- Object Oriented Design
- Amazon Leadership Principles
Stay confident.
For System Design and OOD, always clarify the requirements since it's very open-ended and subjective. And do keep an eye on the clock.
What people are saying about Amazon
I applied via campus placement at Dehradun Institute of Technology, Dehradun 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
(2 Questions)
- Q1. Reverse a linked list
- Ans.
Reverse a singly linked list and return the reversed list.
Iterate through the linked list and reverse the pointers
Use three pointers to keep track of current, previous, and next nodes
Update the head pointer to the last node after reversing
- Q2. Dfs of a graph
- Ans.
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 -&
Interview Preparation Tips
Skills evaluated in this interview
Amazon interview questions for designations
(2 Questions)
- Q1. Least Common Ancestor of binary tree
- Ans.
The least common ancestor of a binary tree is the node that is the lowest common ancestor of two given nodes in the tree.
Start from the root node and recursively search for the given nodes in the left and right subtrees.
If one node is found in the left subtree and the other in the right subtree, then the current node is the least common ancestor.
If both nodes are found in the left subtree, then the least common ancesto...
- Q2. Smallest path to reach from a to b point in matrix
- Ans.
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
Get interview-ready with Top Amazon Interview Questions
Hacker rank test include 2 code and mcg questions
(2 Questions)
- Q1. Coding based on linked list
- Q2. String related coding questions
Software Developer Jobs at Amazon
Two coding questions, both passed 100%
(1 Question)
- Q1. What is the problem of identifying duplicates in an array?
- Ans.
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
(2 Questions)
- Q1. Live coding with the hr
- Q2. Binary Trees based traversal
Selected
I applied via Referral and was interviewed in Aug 2024. There were 3 interview rounds.
COding test consist of 2 question of easy level, both of easy level and queue
(2 Questions)
- Q1. Projects Discussion
- Q2. System Design Problems, Real World
(2 Questions)
- Q1. Culture fit round discussion
- Q2. Future fit round, Company fit
Interview Preparation Tips
Selected
I applied via Internshala and was interviewed in Nov 2024. There were 3 interview rounds.
Genral Aptitude questions
Normal Coding Test DSA, Data Strcuures
(1 Question)
- Q1. HR and Resume based
Mostly DSA and problem solving.
(2 Questions)
- Q1. Graph theory based question related to Chess board
- Q2. Dynamic programming related quesiton
Amazon Interview FAQs
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.
Tell us how to improve this page.
Amazon Interviews By Designations
- Amazon Software Developer Interview Questions
- Amazon Customer Service Associate Interview Questions
- Amazon Customer Service Executive Interview Questions
- Amazon Transaction Risk Investigator Interview Questions
- Amazon Software Developer Intern Interview Questions
- Amazon Associate Interview Questions
- Amazon Seller Support Associate Interview Questions
- Amazon Software Engineer Interview Questions
- Show more
Interview Questions for Popular Designations
- Senior Software Developer Interview Questions
- Associate Software Developer Interview Questions
- Lead Software Engineer Interview Questions
- Software Development Engineer II Interview Questions
- Software Engineer Interview Questions
- Software Development Engineer 1 Interview Questions
- Software Engineer Level 1 Interview Questions
- Senior Software Engineer Interview Questions
- Show more
Amazon Software Developer Interview Process
based on 117 interviews
5 Interview rounds
- Coding Test Round - 1
- Coding Test Round - 2
- Video Call Round - 1
- Video Call Round - 2
- Video Call Round - 3
Software Developer Interview Questions from Similar Companies
Fast track your campus placements
Amazon Software Developer Reviews and Ratings
based on 262 reviews
Rating in categories
|
Customer Service Associate
4.2k
salaries
|  ₹0.6 L/yr - ₹6.8 L/yr |
|
Transaction Risk Investigator
3.1k
salaries
| ₹2.3 L/yr - ₹6.5 L/yr |
|
Associate
2.8k
salaries
| ₹0.8 L/yr - ₹6.9 L/yr |
|
Senior Associate
2.5k
salaries
| ₹2 L/yr - ₹10.1 L/yr |
|
Program Manager
2.3k
salaries
| ₹9 L/yr - ₹36 L/yr |
Flipkart
TCS
Netflix
- Home >
- Interviews >
- Amazon Interview Questions >
- Amazon Software Developer Interview Questions
