Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Amazon Team. If you also belong to the team, you can get access from here

Amazon Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Amazon Software Developer Intern Interview Questions and Answers

Updated 29 Jun 2025

165 Interview questions

A Software Developer Intern was asked
Q. 

Merge k Sorted Linked Lists

You are provided with 'K' sorted linked lists, each sorted in increasing order. Your task is to merge all these lists into one single sorted linked list and return the head of t...

Ans. 

Merge k sorted linked lists into one single sorted linked list.

  • Create a min-heap to store the heads of all k linked lists.

  • Pop the smallest element from the heap and add it to the result list.

  • If the popped element has a next element, push it back into the heap.

  • Repeat until all elements are merged into a single sorted list.

A Software Developer Intern was asked
Q. 

Next Smaller Element Problem Statement

You are provided with an array of integers ARR of length N. Your task is to determine the next smaller element for each array element.

Explanation:

The Next Smaller...

Ans. 

Given an array of integers, find the next smaller element for each element in the array.

  • Iterate through the array from right to left and use a stack to keep track of elements.

  • Pop elements from the stack until a smaller element is found or the stack is empty.

  • If no smaller element is found, output -1 for that element.

Software Developer Intern Interview Questions Asked at Other Companies

Q1. Sum of Maximum and Minimum Elements Problem Statement Given an ar ... read more
asked in Amazon
Q2. Fish Eater Problem Statement In a river where water flows from le ... read more
asked in Apple
Q3. Kevin and his Fruits Problem Statement Kevin has 'N' buckets, eac ... read more
asked in CommVault
Q4. Sliding Maximum Problem Statement Given an array of integers ARR ... read more
Q5. Reverse Words in a String: Problem Statement You are given a stri ... read more
A Software Developer Intern was asked
Q. 

Print in Wave Form Problem Statement

Given a two-dimensional integer array/list 'ARR' of size (N x M), your aim is to print the elements of 'ARR' in a sine wave order. This means that you should print elem...

Ans. 

Print elements of a 2D array in a sine wave order.

  • Traverse the array in a zigzag pattern, alternating between top to bottom and bottom to top for each column.

  • Use two pointers to keep track of the current row and column while printing the elements.

  • Handle edge cases such as empty arrays or arrays with only one row or column.

  • Example: For input [[1, 2], [3, 4]], the output should be [1, 3, 2, 4].

A Software Developer Intern was asked
Q. 

Delete N Nodes After M Nodes in a Linked List

Given a singly linked list and two integers 'N' and 'M', traverse the linked list to retain 'M' nodes and then delete the next 'N' nodes. Continue this process...

Ans. 

Implement a function to delete N nodes after M nodes in a linked list.

  • Traverse the linked list while retaining M nodes and deleting N nodes after each M nodes.

  • Use two pointers to keep track of the nodes to be retained and deleted.

  • Update the next pointers accordingly to skip the nodes to be deleted.

  • Repeat the process until the end of the linked list is reached.

What people are saying about Amazon

View All
cigerrateaddict
1d
works at
Ernst & Young
1,300 Jobs Gone. Because AI Can Now Do It Faster.
Glassdoor and Indeed just laid off 1,300 people yes, the same platforms that help people find jobs are now letting go of their own. Why? cz their parent company is going all-in on AI to “streamline” hiring. Most of these layoffs hit R&D, HR, and sustainability teams in the US. Even glassdoor’s CEO is stepping down. The plan now is to merge glassdoor into Indeed and let AI take over a big chunk of the backend work. Their CEO literally said “AI is changing the world, and we need to move faster and fix what’s broken. Today, about one-third of their code is written by AI. Soon, that could be 50%. And they’re not alone Microsoft, Google, Amazon… all are cutting jobs while letting AI do more of the work. Just last week, Intel cut 4,000 jobs, Microsoft let go of 6,000 CrowdStrike laid off 5% of its staff And all of this, even when profits were up. Scary, isn’t it?
Got a question about Amazon?
Ask anonymously on communities.
🔥 Asked by recruiter 2 times
A Software Developer Intern was asked
Q. Can you explain the ACID properties in the context of database management systems?
Ans. 

ACID properties ensure database transactions are processed reliably and consistently.

  • Atomicity: All operations in a transaction are completed successfully or none at all.

  • Consistency: Database remains in a consistent state before and after the transaction.

  • Isolation: Transactions are isolated from each other until they are completed.

  • Durability: Once a transaction is committed, changes are permanent and survive syste...

🔥 Asked by recruiter 2 times
A Software Developer Intern was asked
Q. 

Rearrange Array to Form Largest Number

Given an array ARR consisting of non-negative integers, rearrange the numbers to form the largest possible number. The digits within each number cannot be changed.

I...

Ans. 

Rearrange array elements to form the largest number possible by concatenating them.

  • Sort the array elements in a custom way where the concatenation of two numbers results in a larger number.

  • Use a custom comparator function to sort the array elements.

  • Convert the sorted array elements to a single string to get the largest possible number.

A Software Developer Intern was asked
Q. 

Maximum Product Subarray Problem Statement

Given an array of integers, determine the contiguous subarray that produces the maximum product of its elements.

Explanation:

A subarray can be derived from the...

Ans. 

Find the contiguous subarray with the maximum product of elements in an array.

  • Iterate through the array and keep track of the maximum and minimum product ending at each index.

  • Update the maximum product by taking the maximum of current element, current element * previous maximum, and current element * previous minimum.

  • Update the minimum product by taking the minimum of current element, current element * previous ma...

Are these interview questions helpful?
🔥 Asked by recruiter 9 times
A Software Developer Intern was asked
Q. 

Longest Increasing Subsequence Problem Statement

Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This ...

Ans. 

Find the length of the longest strictly increasing subsequence in an array of integers.

  • Use dynamic programming to solve this problem efficiently.

  • Initialize an array to store the length of the longest increasing subsequence ending at each index.

  • Iterate through the array and update the length of the longest increasing subsequence for each element.

  • Return the maximum value in the array as the length of the longest inc...

🔥 Asked by recruiter 2 times
A Software Developer Intern was asked
Q. 

Height of Binary Tree

You are provided with the Inorder and Level Order traversals of a Binary Tree composed of integers. Your goal is to determine the height of this Binary Tree without actually construct...

Ans. 

Calculate the height of a Binary Tree using Inorder and Level Order traversals without constructing the tree.

  • Use the properties of Inorder and Level Order traversals to determine the height of the Binary Tree.

  • The height of a Binary Tree is the number of edges on the longest path from the root to a leaf node.

  • Consider edge cases like a single node tree or empty tree while calculating the height.

🔥 Asked by recruiter 3 times
A Software Developer Intern was asked
Q. 

Find Missing Number In String Problem Statement

You have a sequence of consecutive nonnegative integers. By appending all integers end-to-end, you formed a string S without any separators. During this proc...

Ans. 

Find the missing number in a string of consecutive nonnegative integers.

  • Iterate through the string to find the missing number by checking the consecutive integers.

  • If there is more than one missing number, all integers are present, or the string is invalid, return -1.

  • Handle cases where the missing number is at the beginning or end of the string.

  • Consider edge cases such as single-digit strings or strings with leadin...

Amazon Software Developer Intern Interview Experiences

97 interviews found

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via LinkedIn and was interviewed in Sep 2024. There were 2 interview rounds.

Round 1 - Coding Test 

Easy Questions- Can be done with decent practice

Round 2 - Technical 

(2 Questions)

  • Q1. Array question - basic knowledge sufficient
  • Q2. Maths questions + stack implementation
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
-
Result
Not Selected
Round 1 - Coding Test 

Coding test had 2 medium level coding questions

Round 2 - One-on-one 

(2 Questions)

  • Q1. The first question was of sliding window plus DP
  • Q2. The second was of trees
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Approached by Company and was interviewed in Aug 2024. There were 2 interview rounds.

Round 1 - Coding Test 

2 coding questions of easy to medium difficulty

Round 2 - Technical 

(2 Questions)

  • Q1. A derivative of rotten oranges.
  • Q2. An sliding window problem similar to Maximum number of fruits in two basket
  • Ans. 

    Sliding window problem where you can only pick fruits from two different baskets

    • Use a sliding window approach to keep track of the maximum number of fruits in two baskets

    • Keep track of the types of fruits and their counts in the window

    • Update the window by removing fruits from the beginning and adding fruits from the end

    • Keep track of the maximum number of fruits seen so far

  • Answered by AI

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Aug 2024. There were 2 interview rounds.

Round 1 - Coding Test 

2 leetcode easy problems, arrays and strings.

Round 2 - One-on-one 

(2 Questions)

  • Q1. Minimum window substring
  • Ans. 

    Find the smallest substring in a string that contains all characters of another string.

    • Use two pointers to maintain a sliding window over the string.

    • Count characters in the target string using a hash map.

    • Expand the window by moving the right pointer and contract it by moving the left pointer.

    • Example: For s = 'ADOBECODEBANC' and t = 'ABC', the result is 'BANC'.

    • Keep track of the minimum length and starting index of valid...

  • Answered by AI
  • Q2. Minimum sum of subarray
  • Ans. 

    Find the minimum sum of a subarray within an array of integers.

    • Iterate through the array and keep track of the current sum of subarray

    • Update the minimum sum if a smaller sum is found

    • Consider using Kadane's algorithm for an efficient solution

  • Answered by AI

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
No response

I appeared for an interview in Mar 2025, where I was asked the following questions.

  • Q1. BFS of graph
  • Ans. 

    BFS (Breadth-First Search) is an algorithm for traversing or searching tree or graph data structures level by level.

    • Level Order Traversal: BFS explores all neighbors at the present depth prior to moving on to nodes at the next depth level.

    • Queue Data Structure: BFS uses a queue to keep track of nodes to be explored, ensuring nodes are processed in the order they are discovered.

    • Shortest Path: In unweighted graphs, BFS ca...

  • Answered by AI
  • Q2. Behavioural questions
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Not Selected

I appeared for an interview in Dec 2024, where I was asked the following questions.

  • Q1. The interviewer provided a brief introduction before inquiring about my background, then immediately proceeded to data structures and algorithms; my first question was the "Number of Islands" problem from ...
  • Q2. I was asked to provide an optimal approach for the problem "Maximum Area by Changing One 0 to 1," but since I had not addressed it earlier, I was unable to respond effectively.
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Approached by Company and was interviewed in May 2024. There were 2 interview rounds.

Round 1 - Coding Test 

It had very basic dsa problem I don't not remember the exact question. It was based on array manipulation.

Round 2 - One-on-one 

(2 Questions)

  • Q1. Rotten oranges graph question
  • Ans. 

    The Rotten Oranges problem involves determining the time taken for all oranges to rot in a grid.

    • Model the grid as a graph where each cell represents an orange.

    • Use BFS to simulate the rotting process, starting from all initially rotten oranges.

    • Count the minutes taken for all reachable fresh oranges to rot.

    • Example: In a 2D grid, rotten oranges spread to adjacent fresh oranges every minute.

  • Answered by AI
  • Q2. One standard dp question which could be solved in 4-5 line of code
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via LinkedIn and was interviewed in Jun 2024. There were 2 interview rounds.

Round 1 - Coding Test 

Basic aptitude and data structures along with some personality based questions

Round 2 - Technical 

(2 Questions)

  • Q1. Coding question on sliding window algorithm
  • Ans. 

    The sliding window algorithm efficiently solves problems involving contiguous subarrays or substrings.

    • Used to find maximum/minimum in a subarray of fixed size. Example: max sum of any 3 consecutive elements.

    • Helps in counting distinct elements in a substring. Example: count of unique characters in 'abcabc'.

    • Can be applied to problems like longest substring without repeating characters. Example: 'abcabcbb' -> 'abc'.

    • Use...

  • Answered by AI
  • Q2. Standard leetcode medium problem on binary search
  • Ans. 

    Binary search is an efficient algorithm for finding an item from a sorted list of items.

    • Binary search works on sorted arrays. Example: [1, 2, 3, 4, 5].

    • It divides the search interval in half. If the target is less than the middle element, search the left half.

    • Time complexity is O(log n), making it faster than linear search (O(n)).

    • Example: To find 3 in [1, 2, 3, 4, 5], check middle (3), found it immediately.

    • If the target...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - practise well before the interviews
Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

LC Medium - 2 questions

Round 2 - One-on-one 

(2 Questions)

  • Q1. LC Medium on two-pointers
  • Ans. 

    Two-pointer technique is used to solve problems involving arrays or linked lists by using two pointers to traverse the data structure.

    • Start with two pointers at different positions in the array or linked list

    • Move the pointers based on the problem requirements (e.g. one pointer moves faster than the other)

    • Commonly used in problems like finding a pair of elements that sum up to a target value

  • Answered by AI
  • Q2. LC Medium-Hard on DP

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Referral and was interviewed in Mar 2024. There was 1 interview round.

Round 1 - One-on-one 

(2 Questions)

  • Q1. Sliding window question
  • Q2. Trees medium level

Interview Preparation Tips

Topics to prepare for Amazon Software Developer Intern interview:
  • DSA

Amazon Interview FAQs

How many rounds are there in Amazon Software Developer Intern interview?
Amazon interview process usually has 2-3 rounds. The most common rounds in the Amazon interview process are Coding Test, Technical and One-on-one Round.
What are the top questions asked in Amazon Software Developer Intern interview?

Some of the top questions asked at the Amazon Software Developer Intern interview -

  1. First question was on binary search in which you were given two arrays and an i...read more
  2. Second question was a variation of stock span problem. You were given an array ...read more
  3. Heap based( where if two rocks have same weight, eliminate both, otherwise keep...read more
How long is the Amazon Software Developer Intern interview process?

The duration of Amazon Software Developer Intern interview process can vary, but typically it takes about 2-4 weeks to complete.

Tell us how to improve this page.

Overall Interview Experience Rating

4.3/5

based on 43 interview experiences

Difficulty level

Easy 14%
Moderate 75%
Hard 11%

Duration

Less than 2 weeks 47%
2-4 weeks 47%
4-6 weeks 7%
View more

Interview Questions from Similar Companies

Uber Interview Questions
4.2
 • 156 Interviews
Expedia Group Interview Questions
3.7
 • 78 Interviews
LinkedIn Interview Questions
4.2
 • 69 Interviews
OLX Interview Questions
3.8
 • 60 Interviews
Facebook Interview Questions
4.3
 • 55 Interviews
Uplers Interview Questions
3.9
 • 43 Interviews
Groupon Interview Questions
3.1
 • 42 Interviews
Fareportal Interview Questions
3.3
 • 32 Interviews
Yahoo Interview Questions
4.6
 • 30 Interviews
Airbnb Interview Questions
3.7
 • 25 Interviews
View all
Amazon Software Developer Intern Salary
based on 41 salaries
₹5 L/yr - ₹11.2 L/yr
26% more than the average Software Developer Intern Salary in India
View more details

Amazon Software Developer Intern Reviews and Ratings

based on 91 reviews

4.3/5

Rating in categories

4.3

Skill development

3.6

Work-life balance

4.6

Salary

3.1

Job security

3.9

Company culture

3.9

Promotions

4.0

Work satisfaction

Explore 91 Reviews and Ratings
Customer Service Associate
4k salaries
unlock blur

₹1.8 L/yr - ₹5 L/yr

Transaction Risk Investigator
3.1k salaries
unlock blur

₹2.4 L/yr - ₹6.5 L/yr

Associate
3.1k salaries
unlock blur

₹2 L/yr - ₹5.5 L/yr

Senior Associate
2.6k salaries
unlock blur

₹4 L/yr - ₹9 L/yr

Software Developer
2.4k salaries
unlock blur

₹23.3 L/yr - ₹43.4 L/yr

Explore more salaries
Compare Amazon with

Flipkart

3.9
Compare

TCS

3.6
Compare

Google

4.4
Compare

Netflix

4.0
Compare
write
Share an Interview