AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
i
Amazon
Compare
Proud winner of ABECA 2025 - AmbitionBox Employee Choice Awards
Filter interviews by
Amazon SDE Intern Interview Questions and Answers
11 Interview questions
Remove duplicates from a sorted linked list
Use two pointers - one to iterate through the list and another to keep track of unique elements
Compare current node with next node, if they are equal, skip the next node
Repeat until end of list is reached
Find leaf nodes in a binary tree and print path to each leaf node.
Traverse the binary tree using depth-first search (DFS)
When reaching a leaf node, store the path from root to that leaf node
Repeat the process for all leaf nodes in the tree
Implement a stack that supports push, pop, top, and retrieving the minimum element in constant time.
Use two stacks - one to store the actual elements and another to store the minimum values.
When pushing an element, check if it is smaller than the current minimum and push it to the min stack if so.
When popping an element, check if it is the current minimum and pop from the min stack if so.
Top operation can be imple...
The majority element in an array appears more than n/2 times. We can find it using various algorithms.
Use Boyer-Moore Voting Algorithm for O(n) time and O(1) space complexity.
Example: In [3, 2, 3], the majority element is 3.
Another method is using a hash map to count occurrences.
Example: In [1, 1, 2, 2, 2], the majority element is 2.
What people are saying about Amazon
Min-stack is implemented using O(N) space by keeping track of minimum value at each element.
Use two stacks - one to store the actual elements and another to store the minimum value at each step.
When pushing an element, check if it is smaller than the current minimum and update the minimum stack accordingly.
When popping an element, also pop from the minimum stack if the popped element is the current minimum.
Find the next permutation of a given timestamp in HH:MM AM/PM format.
Convert the timestamp to a 24-hour format for easier manipulation.
Identify the rightmost pair where the earlier digit is smaller than the later one.
Swap this digit with the smallest larger digit to its right.
Reverse the digits to the right of the swapped position to get the next permutation.
Example: For '11:55 PM', the next permutation is '12:00 ...
Find square root of a number using basic arithmetic operations without power operator and inbuilt libraries.
Use binary search to find the integer part of the square root
Use long division method to find the decimal part of the square root
Repeat the above steps until desired accuracy is achieved
Handle edge cases like negative numbers and numbers less than 1
Addition of two linked lists and return the result as a linked list.
Traverse both linked lists simultaneously
Add corresponding nodes and carry over the sum
Create a new linked list with the sum
Find the deepest left node in a binary tree.
Traverse the tree recursively and keep track of the depth and whether the current node is a left node.
If the current node is a leaf node and its depth is greater than the deepest left node found so far, update the deepest left node.
Return the deepest left node found.
Example: For the binary tree with root node 1, left child 2, and left child of 2 being 4, the deepest left...
Count occurrences of a given element in a sorted array.
Use binary search to find the first and last occurrence of the element.
Subtract the indices to get the count.
Handle edge cases like element not present in the array.
Amazon SDE Intern Interview Experiences
16 interviews found
Anonymous
I applied via Campus Placement and was interviewed in Dec 2024. There was 1 interview round.
(4 Questions)
- Q1. Tell us about yourself.
- Ans.
I am a computer science student with a passion for coding and problem-solving.
Currently pursuing a degree in computer science
Proficient in programming languages like Java, Python, and C++
Experience with data structures and algorithms
Completed internships at tech companies like Google and Microsoft
- Q2. Can you explain any recent projects you have worked on?
- Ans.
Developed a web application for tracking personal fitness goals and progress.
Used React for front-end development
Implemented RESTful APIs using Node.js and Express for back-end
Utilized MongoDB for database storage
Incorporated chart.js for visualizing progress data
- Q3. Given a sorted linked list, how can you remove duplicates from it?
- Ans.
Remove duplicates from a sorted linked list
Use two pointers - one to iterate through the list and another to keep track of unique elements
Compare current node with next node, if they are equal, skip the next node
Repeat until end of list is reached
- Q4. There was a String based leetcode hard level question
It was mcqs with one coding question
It consisted of 2 medium coding ques
(2 Questions)
- Q1. It was a binary tree medium level leetcode ques
- Q2. It was majority element ques from leetcode
- Ans.
The majority element in an array appears more than n/2 times. We can find it using various algorithms.
Use Boyer-Moore Voting Algorithm for O(n) time and O(1) space complexity.
Example: In [3, 2, 3], the majority element is 3.
Another method is using a hash map to count occurrences.
Example: In [1, 1, 2, 2, 2], the majority element is 2.
Selected
I applied via Approached by Company and was interviewed in Aug 2024. There were 2 interview rounds.
2 DSA questions and 70 minutes.
(2 Questions)
- Q1. Implement Min-stack using O(N) space .
- Ans.
Min-stack is implemented using O(N) space by keeping track of minimum value at each element.
Use two stacks - one to store the actual elements and another to store the minimum value at each step.
When pushing an element, check if it is smaller than the current minimum and update the minimum stack accordingly.
When popping an element, also pop from the minimum stack if the popped element is the current minimum.
- Q2. Sliding Window Problem.
- Ans.
Sliding Window Problem involves finding a subarray of fixed size k with the maximum sum.
Use a sliding window approach to iterate through the array and keep track of the sum of elements within the window.
Slide the window by removing the first element and adding the next element in each iteration.
Keep track of the maximum sum found so far and update it if a new maximum is found.
Interview Preparation Tips
Skills evaluated in this interview
I appeared for an interview in Feb 2025, where I was asked the following questions.
- Q1. Can you describe a specific deadline you encountered and how you managed it?
- Ans.
I faced a tight deadline for a project, which I managed through prioritization, teamwork, and effective communication.
Identified the project scope and key deliverables within the first day.
Created a timeline with milestones to track progress.
Delegated tasks based on team members' strengths, ensuring efficiency.
Held daily stand-up meetings to address challenges and keep everyone aligned.
Utilized project management tools...
- Q2. What was your experience in making a business decision without your manager's input?
Radhika
Selected
I applied via Company Website and was interviewed in May 2024. There were 3 interview rounds.
This round had questions from various topics like DBMS, system design, OOPs, aptitude etc. with one coding ques.
This had 2 coding questions (medium level) and a digital HR round where we just have to use a slider to answer our best reaction to situations.
(2 Questions)
- Q1. Implementation of Min Stack
- Ans.
Implement a stack that supports push, pop, top, and retrieving the minimum element in constant time.
Use two stacks - one to store the actual elements and another to store the minimum values.
When pushing an element, check if it is smaller than the current minimum and push it to the min stack if so.
When popping an element, check if it is the current minimum and pop from the min stack if so.
Top operation can be implemente...
- Q2. Find leaf nodes in a binary tree ,followed by printing path to leaf nodes.
- Ans.
Find leaf nodes in a binary tree and print path to each leaf node.
Traverse the binary tree using depth-first search (DFS)
When reaching a leaf node, store the path from root to that leaf node
Repeat the process for all leaf nodes in the tree
Skills evaluated in this interview
I applied via Campus Placement and was interviewed in Sep 2024. There was 1 interview round.
I was asked to do a string based hard level question. Interviewerr asked me how the code worked and the logic which i explained step by step.
Interview Preparation Tips
Selected
I applied via Newspaper Ad and was interviewed in Apr 2024. There was 1 interview round.
(1 Question)
- Q1. DSA question to be solved
2 hours mcqs from all cse related topics + 1 coding question
3 coding questions easy level
(1 Question)
- Q1. I do not remember
OA + behavioural questions
(1 Question)
- Q1. Leetcode medium
(1 Question)
- Q1. Leetcode medium
priyansha singhal
It was a 2 hour test having 2 coding questions . Difficulty was easy and medium.
(1 Question)
- Q1. Two questions were asked . To make a BST from array elements . Snakes and ladder. Besides this interviewer also asked about my projects and basic introduction.
Amazon Interview FAQs
Some of the top questions asked at the Amazon SDE Intern interview -
The duration of Amazon SDE Intern 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
Overall Interview Experience Rating
based on 14 interview experiences
Difficulty level
Duration
Interview Questions from Similar Companies
Amazon SDE Intern Reviews and Ratings
based on 9 reviews
Rating in categories
|
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.4k
salaries
| ₹23.7 L/yr - ₹44 L/yr |
Flipkart
TCS
Netflix
- Home >
- Interviews >
- Amazon Interview Questions
