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

Clear (1)

Amazon Software Developer Intern Interview Questions, Process, and Tips

Updated 17 Feb 2025

Top Amazon Software Developer Intern Interview Questions and Answers

  • Q1. Fish Eater Problem Statement In a river where water flows from left to right, there is a sequence of 'N' fishes each having different sizes and speeds. The sizes of thes ...read more
  • Q2. First Missing Positive Problem Statement You are provided with an integer array ARR of length 'N'. Your objective is to determine the first missing positive integer usin ...read more
  • Q3. Container with Most Water Problem Statement Given a sequence of 'N' space-separated non-negative integers A[1], A[2], ..., A[i], ..., A[n], where each number in the sequ ...read more
View all 188 questions

Amazon Software Developer Intern Interview Experiences

94 interviews found

I was interviewed in Dec 2020.

Round 1 - Coding Test 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Easy

3 coding questions and the duration of the test was 90 mins

  • Q1. 

    Merge Two Sorted Linked Lists Problem Statement

    You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.

    ...
  • Ans. 

    Merge two sorted linked lists into a single sorted linked list without using additional space.

    • Create a dummy node to start the merged list

    • Compare the nodes of both lists and link them accordingly

    • Move the pointer to the next node in the merged list

    • Handle cases where one list is empty or both lists are empty

    • Time complexity: O(n), Space complexity: O(1)

  • Answered by AI
  • Q2. 

    Rat in a Maze Problem Statement

    You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...

  • Ans. 

    Find all possible paths for a rat in a maze from source to destination.

    • Use backtracking to explore all possible paths in the maze.

    • Keep track of visited cells to avoid revisiting them.

    • Explore all possible directions ('U', 'D', 'L', 'R') from each cell.

    • Terminate the search when the destination cell is reached.

    • Return the list of valid paths sorted in alphabetical order.

  • Answered by AI
  • Q3. 

    Find All Pairs Adding Up to Target

    Given an array of integers ARR of length N and an integer Target, your task is to return all pairs of elements such that they add up to the Target.

    Input:

    The first line ...
  • Ans. 

    Given an array of integers and a target, find all pairs of elements that add up to the target.

    • Iterate through the array and for each element, check if the complement (target - current element) exists in a hash set.

    • If the complement exists, add the pair to the result. If not, add the current element to the hash set.

    • Handle cases where the same element is used twice in a pair to avoid duplicates.

    • Return (-1, -1) if no pair...

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Easy

  • Q1. 

    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 keep track of the longest increasing subsequence ending at each element.

    • 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 ar...

  • Answered by AI
  • Q2. 

    Boundary Traversal of a Binary Tree

    Given a binary tree of integers, your task is to return the boundary nodes of the tree in Anti-Clockwise direction starting from the root node.

    Input:

    The first line ...
  • Ans. 

    Return the boundary nodes of a binary tree in Anti-Clockwise direction starting from the root node.

    • Traverse the left boundary nodes in top-down order

    • Traverse the leaf nodes from left to right

    • Traverse the right boundary nodes in bottom-up order

    • Handle cases where duplicates occur in the boundary nodes

    • Implement the function without printing as printing is already managed

  • Answered by AI
  • Q3. 

    Spiral Matrix Problem Statement

    You are given a N x M matrix of integers. Your task is to return the spiral path of the matrix elements.

    Input

    The first line contains an integer 'T' which denotes the nu...
  • Ans. 

    The task is to return the spiral path of elements in a given matrix.

    • Iterate through the matrix in a spiral path by keeping track of boundaries.

    • Print elements in the order of top, right, bottom, and left sides of the matrix.

    • Handle cases where the matrix is not a square matrix separately.

    • Consider edge cases like single row or single column matrices.

  • Answered by AI
Round 3 - Video Call 

Round duration - 50 Minutes
Round difficulty - Medium

This was the last round, which consists of some basic hr questions and theory questions.

Interview Preparation Tips

Eligibility criteria8 cgpaAmazon interview preparation:Topics to prepare for the interview - Data Structures and Algorithm, OS, DBMS, CN, Oops Concepts,Time required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Single page resume but brief
Tip 2 : Be calm and confident
Tip 3 : Solve previous interview questions of Amazon

Application resume tips for other job seekers

Tip 1 : Don't make resume too lengthy.
Tip 2 : Mention your achievements in resume if any

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Dec 2020.

Round 1 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

The interviewer was very friendly and introduced herself. She told me that she had two coding problems for this round.

  • Q1. 

    Spiral Order Traversal of a Binary Tree

    Given a binary tree with N nodes, your task is to output the Spiral Order traversal of the binary tree.

    Input:

    The input consists of a single line containing elem...
  • Ans. 

    Implement a function to return the spiral order traversal of a binary tree.

    • Traverse the binary tree in a spiral order, alternating between left to right and right to left.

    • Use a queue to keep track of nodes at each level and a flag to switch direction.

    • Handle null nodes appropriately to maintain the spiral order traversal.

    • Example: Input: 1 2 3 -1 -1 4 5, Output: 1 3 2 4 5

  • Answered by AI
  • Q2. 

    Find Row With Maximum 1's in a Sorted 2D Matrix

    You are provided with a 2D matrix containing only the integers 0 or 1. The matrix has dimensions N x M, and each row is sorted in non-decreasing order. Your...

  • Ans. 

    Find the row with the maximum number of 1's in a sorted 2D matrix.

    • Iterate through each row of the matrix and count the number of 1's in each row.

    • Keep track of the row index with the maximum number of 1's encountered so far.

    • Return the index of the row with the maximum number of 1's.

    • If multiple rows have the same number of 1's, return the row with the smallest index.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 70 minutes
Round difficulty - Medium

This round was held 30 minutes after the 2nd round. There were two interviewers and both introduced themselves. Both of them were friendly and made me comfortable for the round.

  • Q1. 

    Sort Array by Set Bit Count

    You have an array of N positive integers. Your goal is to sort this array in descending order based on the number of set bits in the binary representation of each integer.

    In ...

  • Ans. 

    Sort array of positive integers based on set bit count in descending order.

    • Count set bits for each integer using bitwise operations.

    • Implement a custom comparator function to sort the array based on set bit count.

    • Handle cases where integers have the same set bit count by retaining their original order.

  • Answered by AI
  • Q2. 

    Rotting Oranges Problem Statement

    You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:

    • 0 - representing an empty cell
    • 1 - representing a fre...
  • Ans. 

    Find minimum time to rot all fresh oranges adjacent to rotten oranges in a grid.

    • Use Breadth First Search (BFS) to simulate the rotting process

    • Keep track of the time taken to rot all fresh oranges

    • Return -1 if not all fresh oranges can be rotten

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in HyderabadEligibility criteriaNo backlogsAmazon interview preparation:Topics to prepare for the interview - Dynamic Programming, Stacks, Array Manipulation, Linked List, Binary Trees, Divide and ConquerTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Learn all basic DSA with their time and space complexities first. Then move on to company-specific problems.
Tip 2 : Have some experience in competitive programming, as it helps you to arrive at solutions quickly.
Tip 3 : Have decent projects and mention them on your resume... Prepare for every possible question that can be asked from them.

Application resume tips for other job seekers

Tip 1 : Be honest on your resume. Don't mention things which you are not comfortable with.
Tip 2 : Have at least two decent projects on your resume... Mentioning tech used in them is a plus.

Final outcome of the interviewSelected

Skills evaluated in this interview

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

I was interviewed in Dec 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 80 minutes
Round difficulty - Medium

This round was scheduled in the evening hours and all the participants were required to fill a form which was shared 2 days prior to the test date. This form was filled out probably for the security reasons and to ensure that no one disinterested participant gives the test.

  • Q1. 

    First Negative Integer in Every Window of Size K

    Given an array of integers 'ARR' and an integer 'K', determine the first negative integer in every contiguous subarray (or window) of size 'K'. If a window...

  • Ans. 

    Find the first negative integer in every window of size K in an array.

    • Iterate through the array using a sliding window approach of size K

    • For each window, find the first negative integer and output it, if none exists output 0

    • Handle edge cases where window size is greater than array size

  • Answered by AI
  • Q2. 

    Maximum Sum of Non-Adjacent Nodes in a Binary Tree

    Given a binary tree with integer values assigned to each node, select nodes such that their sum is maximum, ensuring no two adjacent nodes are picked.

    I...

  • Ans. 

    Find the maximum sum of non-adjacent nodes in a binary tree.

    • Use dynamic programming to keep track of the maximum sum at each node considering whether to include or exclude the current node.

    • Recursively traverse the binary tree while keeping track of the maximum sum of non-adjacent nodes.

    • Consider the scenarios where the current node is included in the sum or excluded from the sum to calculate the maximum possible sum.

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

Interview stared at 11:00 am and went for 90 min.
Interview was held in zoom
Environment was very much user friendly

  • Q1. 

    Validate Binary Search Tree (BST)

    You are given a binary tree with 'N' integer nodes. Your task is to determine whether this binary tree is a Binary Search Tree (BST).

    BST Definition:

    A Binary Search Tr...

  • Ans. 

    Validate if a given binary tree is a Binary Search Tree (BST) or not.

    • Check if the left subtree of a node contains only nodes with data less than the node's data.

    • Check if the right subtree of a node contains only nodes with data greater than the node's data.

    • Recursively check if both the left and right subtrees are also binary search trees.

    • Example: For a tree with root 4, left subtree (2, 1, 3) < 4, right subtree (5)

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in BangaloreEligibility criteriaabove 7.5 cgpa, student from BtechAmazon interview preparation:Topics to prepare for the interview - pointers, arrays, linked list, graphs, trees, constructive algorithms, dynamic programming, brute force approachTime required to prepare for the interview - 6 mothsInterview preparation tips for other job seekers

Tip 1 : Practice all DSA questions from interview bit
Tip 2 : Do Atleast 3 project one should be major, if it's in web dev it would be beneficial.
Tip 3 : Should be good in communication skills

Application resume tips for other job seekers

Tip 1 : have good projects
Tip 2 : try to keep everything descriptive but short at the same time
Tip 3 : also add your competitive profiles in the resume

Final outcome of the interviewRejected

Skills evaluated in this interview

I was interviewed in Dec 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 150 minutes
Round difficulty - Medium

  • Q1. 

    Check If Linked List Is Palindrome

    Given a singly linked list of integers, determine if the linked list is a palindrome.

    Explanation:

    A linked list is considered a palindrome if it reads the same forwar...

  • Ans. 

    Check if a given singly linked list of integers is a palindrome or not.

    • Traverse the linked list to find the middle element using slow and fast pointers.

    • Reverse the second half of the linked list.

    • Compare the first half with the reversed second half to determine if it's a palindrome.

  • Answered by AI
  • Q2. 

    Pair Sum Problem Statement

    You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.

    Note:
    ...
  • Ans. 

    Find pairs of elements in an array that sum up to a given value, sorted in a specific order.

    • Iterate through the array and for each element, check if the complement (S - current element) exists in a hash set.

    • If the complement exists, add the pair (current element, complement) to the result list.

    • Sort the result list based on the first element of each pair, and then based on the second element if the first elements are eq

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

  • Q1. 

    Square Root with Decimal Precision Problem Statement

    You are provided with two integers, 'N' and 'D'. Your objective is to determine the square root of the number 'N' with a precision up to 'D' decimal pl...

  • Ans. 

    Implement a function to find the square root of a number with a specified decimal precision.

    • Implement a function that takes two integers N and D as input and returns the square root of N with precision up to D decimal places.

    • Use mathematical algorithms like Newton's method to approximate the square root with the required precision.

    • Ensure that the difference between the computed result and the true square root is less t...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Chitkara University. Eligibility criteriaNo Backlog and above 6 CGPAAmazon interview preparation:Topics to prepare for the interview - C++, Algorithms, Operating Systems, Object Oriented Programming, Database Management System and Computer Networks, Data Structures(Focus more on trees and graphs)Time required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Have more understanding and confidence over Data Structures and get good understanding of its concepts. At least practice 5-6 coding questions everyday on any coding platform. I had completed around 150+ questions on Leetcode and 250+ questions on Geek For Geeks. Practice regularly rather than completing all coding questions in one go.
Tip 2 : While attempting the questions analyze its time and space complexity. Always work on the strategies to further optimize your solution. Sometimes the interviewer asks only one question and keep on increasing its difficulty by asking for its optimization and will what kind of strategies you implement.
Tip 3 : Along with coding questions keep on studying concepts in details of Operating Systems, databases and object oriented programming. Refer to Geeks For Geeks articles for it. Also refer, Coding Ninja's Data Structures and algorithms course in C++ helped me a lot in improving my OOPS concepts specifically.

Application resume tips for other job seekers

Tip 1 : Mention only those skills, projects or achievements which you have completed yourselves and thorough knowledge. Because there will be question around these and in case if you are not able to answer these basic questions it leaves a bad impact on interviewer.
Tip 2 : No need to add too many projects. Only one or two good projects with proper knowledge is fine. Also do the same for skills, do not add so many skills only add those one in which you can discuss and answer.
Tip 3 : Mention achievements which showcase your technical skills, communication skills, leadership quality or teamwork

Final outcome of the interviewSelected

Skills evaluated in this interview

Amazon interview questions for designations

 Software Engineer Intern

 (13)

 Software Developer

 (187)

 Junior Software Developer

 (3)

 Java Software Developer

 (1)

 Senior Software Developer

 (1)

 Python Developer Intern

 (1)

 Frontend Developer Intern

 (1)

 Full Stack Software Developer

 (1)

I was interviewed in Dec 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 75 Minutes
Round difficulty - Medium

  • Q1. 

    Number of Islands Problem Statement

    You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...

  • Ans. 

    Count the number of islands in a 2D matrix of 1s and 0s.

    • Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.

    • Maintain a visited array to keep track of visited cells to avoid redundant traversal.

    • Increment the island count each time a new island is encountered.

    • Consider edge cases such as when the matrix is empty or all cells are water (0s).

  • Answered by AI
  • Q2. 

    Search in a Row-wise and Column-wise Sorted Matrix Problem Statement

    You are given an N * N matrix of integers where each row and each column is sorted in increasing order. Your task is to find the positi...

  • Ans. 

    Given a sorted N * N matrix, find the position of a target integer 'X'.

    • Iterate over each row and column to search for the target integer 'X'.

    • Utilize the sorted nature of the matrix to optimize the search process.

    • Return the position of 'X' if found, else return '-1 -1'.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

  • Q1. 

    Merge Two Sorted Linked Lists Problem Statement

    You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.

    ...
  • Ans. 

    Merge two sorted linked lists into a single sorted linked list without using additional space.

    • Create a dummy node to start the merged list

    • Compare the nodes of both lists and link them accordingly

    • Move the pointer to the next node in the merged list

    • Handle cases where one list is empty or both lists are empty

    • Time complexity: O(n), Space complexity: O(1)

  • Answered by AI
  • Q2. 

    Pair Sum Problem Statement

    You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.

    Note:
    ...
  • Ans. 

    Find pairs of elements in an array that sum up to a given value, sorted in a specific order.

    • Iterate through the array and for each element, check if the complement (S - current element) exists in a hash set.

    • If the complement exists, add the pair (current element, complement) to the result list.

    • Sort the result list based on the first element of each pair, and then based on the second element if the first elements are eq

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Medium

it was pure DSA round, no HR round was there after this

  • Q1. 

    Rat in a Maze Problem Statement

    You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...

  • Ans. 

    Find all possible paths for a rat in a maze from source to destination.

    • Use backtracking to explore all possible paths in the maze.

    • Keep track of visited cells to avoid revisiting them.

    • Recursively try moving in all directions (up, down, left, right) until reaching the destination.

    • Return the valid paths as a list of strings sorted in alphabetical order.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in BengaluruEligibility criteria7 cgpaAmazon interview preparation:Topics to prepare for the interview - Data Structures, Trees and graphs, Arrays, Backtracking, Pointers, OOPS, System Design, Greedy Algorithms, Dynamic ProgrammingTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Practice as many problems as you can
Tip 2 : Code the problems under by setting some limits
Tip 3 : Consistency is the key

Application resume tips for other job seekers

Tip 1 : Mention at least 2 projects with short description
Tip 2 : Mention your achievements like coding contests and rankings etc

Final outcome of the interviewSelected

Skills evaluated in this interview

Get interview-ready with Top Amazon Interview Questions

I was interviewed in Dec 2020.

Round 1 - Video Call 

(2 Questions)

Round duration - 80 minutes
Round difficulty - Medium

This was Online interview 
this is one and only interview which was based on totally DSA (Problem Solving Skills)
which was held on AMAZE CHIME

Timing : 12pm
Environment was very good

  • Q1. 

    Reverse Linked List Problem Statement

    Given a Singly Linked List of integers, your task is to reverse the Linked List by altering the links between the nodes.

    Input:

    The first line of input is an intege...
  • Ans. 

    Reverse a singly linked list by altering the links between nodes.

    • Iterate through the linked list and reverse the links between nodes

    • Use three pointers to keep track of the previous, current, and next nodes

    • Update the links while traversing the list to reverse it

    • Return the head of the reversed linked list

  • Answered by AI
  • Q2. 

    The Celebrity Problem

    Imagine there are 'N' people at a party, each assigned a unique ID from 0 to N-1. A celebrity at the party is a person who is known by everyone but knows no one else.

    Problem Statem...

  • Ans. 

    Identify the celebrity at a party where one person knows everyone but is not known by anyone.

    • Use a two-pointer approach to eliminate non-celebrity candidates.

    • Start with two pointers at the beginning and end of the party.

    • If A knows B, A cannot be the celebrity; move A to B.

    • If A does not know B, B cannot be the celebrity; move B to A.

    • Repeat until only one person remains; check if this person is known by everyone.

    • Return t

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from Motilal Nehru National Institute of Technology, Allahabad. Eligibility criteriaCSE, IT, ECE, EE above 5 cpiAmazon interview preparation:Topics to prepare for the interview - Data Structure Algorithms, OOOPS, GRAPHS, DPTime required to prepare for the interview - 7 monthsInterview preparation tips for other job seekers

Tip 1 : Code Properly, and do more and more practice on DSA
Tip 2 : Understand the concept behind the problem
Tip 3 : Be confident

Application resume tips for other job seekers

Tip 1 : Write only topics on which you are confident
Tip 2 : Write important stuff only and try to make one page resume only.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Nov 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 Minutes
Round difficulty - Medium

Around 4-5 pm
2 coding questions
7 debugging and output questions
20-30 aptitude questions
A section to test psychology based on various questions and situations.

  • Q1. 

    Clone Linked List with Random Pointer Problem Statement

    Given a linked list where each node has two pointers: one pointing to the next node and another which can point randomly to any node in the list or ...

  • Ans. 

    Cloning a linked list with random pointers by creating new nodes rather than copying references.

    • Create a deep copy of the linked list by iterating through the original list and creating new nodes with the same values.

    • Update the random pointers of the new nodes by mapping the original node's random pointer index to the corresponding new node.

    • Ensure the cloned linked list is an exact copy of the original by validating th...

  • Answered by AI
  • Q2. 

    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 Smalle...

  • 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.

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 50 Minutes
Round difficulty - Medium

Timing - 4pm
Just asked one question based on DSA and asked to make the code modular and well indented.
Didn’t even ask for introduction.

  • Q1. 

    Rotting Oranges Problem Statement

    You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:

    • 0 - representing an empty cell
    • 1 - representing a fre...
  • Ans. 

    Find minimum time to rot all fresh oranges in a grid if adjacent to rotten oranges.

    • Use Breadth First Search (BFS) to simulate the rotting process of oranges.

    • Keep track of the time taken to rot all fresh oranges.

    • If at the end there are still fresh oranges left, return -1 as it is impossible to rot all oranges.

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

Started at 4pm
Interviewer introduced himself and then asked me for a brief introduction.
Went ahead to ask 2 DSA based questions.

  • Q1. 

    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 ...

  • 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.

  • Answered by AI
  • Q2. 

    Rat in a Maze Problem Statement

    You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...

  • Ans. 

    Find all possible paths for a rat in a maze from source to destination.

    • Use backtracking to explore all possible paths in the maze.

    • Keep track of visited cells to avoid revisiting them.

    • Recursively try moving in all directions (up, down, left, right) until reaching the destination.

    • Add the current direction to the path and backtrack if the path leads to a dead end.

    • Return all valid paths found in alphabetical order as an ar

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in BangaloreEligibility criteria7 CGPAAmazon interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Dynamic Programming, OOPS, Trees, GraphsTime required to prepare for the interview - 3 MonthsInterview preparation tips for other job seekers

Tip 1 : Smart Preparation is very important instead of just preparing everything.
Tip 2 : Going through previous interview experiences helps a lot.
Tip 3 : Focussing on time and space complexities instead of just the logic.
Tip 4 : Be thorough with the projects mentioned in resume.
Tip 5 : Daily practice of as many questions as possible with at least a couple of questions with level:Hard

Application resume tips for other job seekers

Tip 1 : Keep it technical and to the point with no catch phrases.
Tip 2 : Use of action verbs to highlight the work put in projects or any previous internships.
Tip 3 : Use of bullet points.
Tip 4 : Mention clickable links of your projects, github account and certificates whenever possible.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Nov 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 Minutes
Round difficulty - Medium

It was in the evening, test consists of technical MCQ as well as Aptitude quesitons. There were debugging round of 7 questions and 2 coding questions (medium-hard leetcode level).

  • Q1. 

    Subtree of Another Tree Problem Statement

    Given two binary trees, T and S, determine whether S is a subtree of T. The tree S should have the same structure and node values as a subtree of T.

    Explanation:

    ...
  • Ans. 

    Given two binary trees T and S, determine if S is a subtree of T with the same structure and node values.

    • Traverse both trees and check if S is a subtree of T at each node

    • Use recursion to compare subtrees

    • Handle edge cases like empty trees or null nodes

  • Answered by AI
  • Q2. 

    Clone Linked List with Random Pointer Problem Statement

    Given a linked list where each node has two pointers: one pointing to the next node and another which can point randomly to any node in the list or ...

  • Ans. 

    Cloning a linked list with random pointers by creating new nodes rather than copying references.

    • Create a deep copy of the linked list by iterating through the original list and creating new nodes with the same values.

    • Update the random pointers of the new nodes by mapping the original node's random pointer index to the corresponding new node.

    • Ensure the cloned linked list is an exact copy of the original by validating th...

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 40 minutes
Round difficulty - Medium

It was in Morning. Interviewer was SDE-2 and was experienced.

  • Q1. 

    Flip Bit to Win Problem Statement

    You are given a task to help ninjas maximize their practice area in a dense forest represented by a sequence of trees (1s) and empty places (0s) in the binary representat...

  • Ans. 

    Given an integer representing a binary sequence, find the maximum consecutive ones by flipping one bit.

    • Iterate through the binary representation of the integer to find the longest sequence of ones.

    • Track the positions of zeros to determine where to flip a bit for maximizing consecutive ones.

    • Update the count of consecutive ones after flipping a zero to one.

    • Return the maximum length of consecutive ones obtained by flippin

  • Answered by AI
  • Q2. 

    Saving Money Problem Statement

    Ninja is adventurous and loves traveling while being mindful of his expenses. Given a set of 'N' stations connected by 'M' trains, each train starting from station 'A' and r...

  • Ans. 

    Given a set of stations connected by trains, find the cheapest fare from a source to a destination with a maximum number of stops allowed.

    • Iterate through all possible routes with up to 'K' stops using a graph traversal algorithm like DFS or BFS.

    • Keep track of the cost for each route and return the minimum cost found.

    • If no route is found within the maximum stops allowed, return '-1'.

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Easy

It was in evening. Interviewer was really energetic and funny.

  • Q1. 

    Find the Row with the Maximum Number of 1's

    You are given a non-empty grid MAT with 'N' rows and 'M' columns, where each element is either 0 or 1. All rows are sorted in ascending order.

    Your task is to ...

  • Ans. 

    Find the row with the maximum number of 1's in a grid of 0's and 1's.

    • Iterate through each row of the grid and count the number of 1's in each row.

    • Keep track of the row index with the maximum number of 1's seen so far.

    • Return the index of the row with the maximum number of 1's.

  • Answered by AI
  • Q2. 

    Knight Probability in Chessboard

    Calculate the probability that a knight remains on an N x N chessboard after making K moves. Initially, the knight is placed at a given position on the board. It can move ...

  • Ans. 

    Calculate the probability that a knight remains on an N x N chessboard after making K moves.

    • Use dynamic programming to calculate the probability of the knight staying on the board after each move.

    • Consider all possible moves the knight can make from its current position.

    • Keep track of the probabilities at each position on the board after each move.

    • Normalize the probabilities at the end to get the final result accurate to

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from Maharaja Surajmal Institute Of Technology. Eligibility criteria7 CGPA with no Backlogs.Amazon interview preparation:Topics to prepare for the interview - Linked List, Binary Search, Dynammic Programming, Two pointer, Hashmap and heap,OOPS, Stack and QueuesTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Try to cover all most common questions of all topics(atleast 300+ questions)
Tip 2 : Try to see as many interview experience as possible of the company you are applying.
Tip 3 : Try to give atleast 2-3 mock interview before main interview

Application resume tips for other job seekers

Tip 1 : Try to put competitive programming ranks if possible or Coding Ninjas Certificate, or any proof that you do programming regularly.
Tip 2 : Try to add atleast 2 projects, and study about those projects well/

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Nov 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

There were 30 MCQ and 7 Debugging question and two coding question
Then technical interview 1
Then last technical plus hr Interview

  • Q1. 

    Flatten BST to a Sorted List

    The objective is to transform a given Binary Search Tree (BST) into a right-skewed BST, effectively flattening it into a sorted list. In the resulting structure, every node's ...

  • Ans. 

    Transform a Binary Search Tree into a right-skewed BST, flattening it into a sorted list.

    • Implement a function to flatten the BST into a sorted list by linking nodes through right children.

    • Traverse the BST in-order and adjust the pointers to create the right-skewed structure.

    • Ensure that every node's left child is NULL in the resulting flattened BST.

    • Output the values of nodes in the skewed BST in level order for each tes...

  • Answered by AI
  • Q2. 

    Prerequisite Task Completion Verification

    Given a positive integer 'N', representing the number of tasks, and a list of dependency pairs, determine if it is possible to complete all tasks considering thes...

  • Ans. 

    Given tasks and dependencies, determine if all tasks can be completed based on prerequisites.

    • Create a graph representation of tasks and dependencies.

    • Use topological sorting to check if there is a cycle in the graph.

    • Return 'Yes' if no cycle is found, 'No' otherwise.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Two questions were given to me and requested to solve in the desired time.

  • Q1. 

    Sort Linked List Based on Actual Values

    Given a Singly Linked List of integers that are sorted based on their absolute values, the task is to sort the linked list based on the actual values.

    The absolute...

  • Ans. 

    Sort a Singly Linked List based on actual values instead of absolute values.

    • Traverse the linked list and store the nodes in an array.

    • Sort the array based on the actual values of the nodes.

    • Reconstruct the linked list using the sorted array.

  • Answered by AI
  • Q2. 

    Convert a Binary Search Tree (BST) to a Greater Sum Tree

    Given a Binary Search Tree of integers, transform it into a Greater Sum Tree where each node's value is replaced with the sum of all node values gr...

  • Ans. 

    Convert a Binary Search Tree to a Greater Sum Tree by replacing each node's value with the sum of all node values greater than the current node's value.

    • Traverse the BST in reverse inorder (right-root-left) to visit nodes in descending order.

    • Keep track of the running sum of visited nodes and update each node's value with this sum.

    • Modify the BST in place without creating a new tree.

    • Example: For input 11 2 29 1 7 15 40 -1...

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

Two questions were asked but I don't remember the second one.

  • Q1. 

    Split Array into K Subarrays

    You are given an array ARR of size N and an integer K. Your task is to split ARR into K sub-arrays such that the maximum sum obtained from these K subarrays is minimized.

    Inp...

  • Ans. 

    Split an array into K subarrays to minimize the maximum sum obtained from the subarrays.

    • Sort the array in descending order to get the maximum sum possible.

    • Use binary search to find the minimum possible value of the maximum sum.

    • Consider the constraints to optimize the solution.

    • Example: For N=4, K=3, ARR=[1, 2, 3, 4], the minimum possible value of the maximum sum is 4.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Maharaja Agrasen Institute Of Technology. I applied for the job as SDE - Intern in HyderabadEligibility criteriaAbove 7.5 CGPAAmazon interview preparation:Topics to prepare for the interview - Trees , Linklist , Graph , Arrays , Binary searchTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Strengthen your base , by doing easy level questions , then try medium level and then hard
Tip 2 : You will face many problems while preparing but stay focused towards your goal

Application resume tips for other job seekers

Tip 1 : A few good projects will do the work
Tip 2 : Provide links of coding platform you are doing well

Final outcome of the interviewRejected

Skills evaluated in this interview

I was interviewed in Nov 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 150 Minutes
Round difficulty - Medium

The test was on AMCAT platform.
The test was of 2.5 hours , web-proctored and switching between tabs was not allowed.

Test consist of 4 sections:

1 Debug section which had 7 questions to correct/write the code. (20min)
2 Coding section having 2 questions. (70 min)
3 Logical Reasoning section. (35 min)
4 Workstyle assessment. (20 min)

  • Q1. 

    Search in a Row-wise and Column-wise Sorted Matrix Problem Statement

    You are given an N * N matrix of integers where each row and each column is sorted in increasing order. Your task is to find the positi...

  • Ans. 

    Given a sorted N * N matrix, find the position of a target integer 'X'.

    • Iterate over each row and column to search for the target integer 'X'.

    • Utilize the sorted nature of the matrix to optimize the search process.

    • Return the position of 'X' if found, else return '-1 -1'.

  • Answered by AI
  • Q2. 

    Subtree of Another Tree Problem Statement

    Given two binary trees, T and S, determine whether S is a subtree of T. The tree S should have the same structure and node values as a subtree of T.

    Explanation:

    ...
  • Ans. 

    Given two binary trees T and S, determine if S is a subtree of T with the same structure and node values.

    • Traverse both trees and check if S is a subtree of T at each node

    • Use recursion to compare subtrees

    • Handle edge cases like empty trees or null nodes

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Hard

Interview was conducted on Amazon Chime platform and for coding, link was shared on which I had to code.
Two questions were given to me and requested to solve in the desired time. 
Interviewer was friendly and supportive.

  • Q1. 

    Reachable Nodes Problem Statement

    You are provided with a graph containing 'N' nodes and 'M' unidirectional edges. Your task is to determine the number of nodes that can be reached from each node 'i', whe...

  • Ans. 

    The task is to determine the number of nodes that can be reached from each node in a graph.

    • Create an adjacency list to represent the graph.

    • Use Depth First Search (DFS) to traverse the graph and count reachable nodes from each node.

    • Initialize a count array to store the number of reachable nodes for each node.

    • Update the count array while traversing the graph using DFS.

    • Output the count array for each test case.

  • Answered by AI
  • Q2. 

    Squares of a Sorted Array Problem Statement

    You are given an array/list ARR consisting of N integers. Your task is to generate a new array/list containing the squares of each element in ARR, with the resu...

  • Ans. 

    Given an array of integers, generate a new array with the squares of each element sorted in increasing order.

    • Iterate through the array and square each element

    • Sort the squared elements in increasing order

    • Return the sorted array

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 45 Minutes
Round difficulty - Medium

Interview was conducted on Amazon Chime platform and for coding, link was shared on which I had to code.
Three questions were given to me and requested to solve in the desired time. 
Interviewer was friendly and supportive.

  • Q1. 

    Valid String Problem Statement

    Given a string S consisting solely of the characters '(', ')', and '*', determine if it is a valid string.

    Definition of Valid String:

    1. Every left parenthesis '(' must h...
  • Ans. 

    Determine if a given string consisting of '(' , ')' and '*' is valid based on certain rules.

    • Iterate through the string and keep track of the count of left parentheses, right parentheses, and stars.

    • Use a stack to keep track of the positions of left parentheses.

    • If at any point the count of right parentheses exceeds the count of left parentheses + stars, the string is invalid.

    • If the stack is not empty at the end, the stri

  • Answered by AI
  • Q2. 

    Convert a Binary Tree to its Sum Tree

    Given a binary tree of integers, convert it to a sum tree where each node is replaced by the sum of the values of its left and right subtrees. Set leaf nodes to zero.

    ...
  • Ans. 

    Convert a binary tree to a sum tree by replacing each node with the sum of its left and right subtrees.

    • Traverse the tree in postorder fashion.

    • For each node, calculate the sum of its left and right subtrees and update the node's value.

    • Set leaf nodes to zero.

    • Return the level order traversal of the modified tree.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Maharaja Agrasen Institute Of Technology. Eligibility criteriaAbove 7 CGPAAmazon interview preparation:Topics to prepare for the interview - Arrays, Binary Search, Strings, Bit Manipulation, Linked Lists, Stacks And Queues, Tree Data Structure, Heaps And Maps, Dynamic Programming, Greedy Algorithm, Graph Data Structure & AlgorithmsTime required to prepare for the interview - 3 MonthsInterview preparation tips for other job seekers

Tip 1 : Practice Company specific DS Algo questions from LeetCode, GFG, Interviewbit, Coding Ninjas etc.
Tip 2 : Take mock interviews with your friends to gain confidence.
Tip 3 : Try Solving Questions on Notepad as in interview IDE will not be provided.

Application resume tips for other job seekers

Tip 1 : Write things in resume like projects, experience and skills which you can explain and defend clearly.
Tip 2 : Add links of your various online platforms profiles like Codechef, Codeforces etc. if you are active on these platforms.

Final outcome of the interviewSelected

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

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. Find zeroes to be flipped so that number of consecutive 1's is maximis...read more
  2. Find shortest distance between 2 points in a matrix, where 2 points can be anyw...read more
  3. maximum profit by buying and selling a stock at most tw...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 less than 2 weeks to complete.

Recently Viewed

PHOTOS

InsuranceDekho

3 office photos

LIST OF COMPANIES

Credit Bajaar

Overview

SALARIES

AVASO Technology Solutions

SALARIES

AVASO Technology Solutions

INTERVIEWS

Saipem

No Interviews

SALARIES

LMW Textile Machinery Division

SALARIES

Vodafone Idea

SALARIES

Vodafone Idea

SALARIES

Vodafone Idea

Tell us how to improve this page.

Amazon Software Developer Intern Interview Process

based on 40 interviews

3 Interview rounds

  • Coding Test Round
  • Video Call Round - 1
  • Video Call Round - 2
View more
Amazon Software Developer Intern Salary
based on 38 salaries
₹5.2 L/yr - ₹19.4 L/yr
86% 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
4.2k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Transaction Risk Investigator
3.1k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Associate
2.8k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Associate
2.5k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Program Manager
2.1k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Amazon with

Flipkart

4.0
Compare

TCS

3.7
Compare

Google

4.4
Compare

Netflix

4.5
Compare
Did you find this page helpful?
Yes No
write
Share an Interview