Amazon Software Developer Interview Questions, Process, and Tips

Round duration - 75 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.
...read more
Add your answer
Q2. 
Max Element in the Path in a Binary Search Tree
Given a Binary Search Tree (BST) and two integers, NODE1 and NODE2, determine the maximum element found along the path from NODE1 to NODE2.
The binary sear...read more
Add your answer

Round duration - 70 minutes
Round difficulty - Medium

Round duration - 120 Minutes
Round difficulty - Medium

It was a coding round of 2 hours.
You need to allow access for camera and microphone

Q1. 
Loot Houses Problem Statement
A thief is planning to steal from several houses along a street. Each house has a certain amount of money stashed. However, the thief cannot loot two adjacent houses. Determi...read more
Ans. 
Determine the maximum amount of money a thief can steal from houses without looting two consecutive houses.
• Use dynamic programming to keep track of the maximum amount of money that can be stolen up to each house.

• At each house, the thief can either choose to steal from the current house and the house two steps back, or skip the current house and steal from the previous house.

• Return the maximum amount of money that can b
Answered by AI
Add your answer
Q2. 
Next Greater Number Problem Statement
Given a string S which represents a number, determine the smallest number strictly greater than the original number composed of the same digits. Each digit's frequenc...read more
Ans. 
Given a number represented as a string, find the smallest number greater than the original with the same set of digits.
• Iterate from right to left to find the first digit that can be swapped with a larger digit to make the number greater.

• Swap this digit with the smallest digit to its right that is larger than it.

• Sort the digits to the right of the swapped digit in ascending order to get the smallest number greater than ...read more
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Medium

The round was an technical face to face round.
They asked me problems related to DBMS, OS

Round duration - 20 Minutes
Round difficulty - Medium

It was face to face another technical round

Round duration - 70 minutes
Round difficulty - Medium

Q1. 
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 ...read more
Add your answer
Q2. 
Shortest Path in a Binary Matrix Problem Statement
Given a binary matrix of size N * M where each element is either 0 or 1, find the shortest path from a source cell to a destination cell, consisting only...read more
Add your answer

Round duration - 75 minutes
Round difficulty - Medium

First explained the approach to the interviewer. He was satisfied with the discussions and asked me to write code.

Q1. 
Special Binary Tree Verification
Determine whether a given binary tree is 'special'. A binary tree is defined as 'special' if every node either has zero or two children.
Example:
Input:
3
5 1
6 2 0 8
-1 -...read more
Add your answer

Round duration - 90 Miinutes
Round difficulty - Medium

This round consists of programming mcqs which many covers datastructure, sql and some pseudocodes and 2 programming questions which are medium level

Q1. 
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 construc...read more
Add your answer

Round duration - 90 Minutes
Round difficulty - Easy

Round 1 was an online coding round consisting of 2 coding questions and 28 MCQs based on C, C++, Java, data structures, algorithms, and core subjects. I solved both the coding questions completely. After getting shortlisted, a total of 4 interviews were to take place, each being eliminative in nature. The time for each was fixed to 60 minutes each and each of them involved writing the complete code on an IDE link shared by the interviewer. For each question, time complexity has to be told.

Q1. 
Infix to Postfix Conversion
Convert a given infix expression, represented as a string EXP, into its equivalent postfix expression.
Explanation:
An infix expression is formatted as a op b where the opera...read more
Ans. 
Convert infix expression to postfix expression.
• Use a stack to keep track of operators and operands.

• Follow the precedence rules for operators (*, / have higher precedence than +, -).

• Handle parentheses to ensure correct order of operations.

• Iterate through the infix expression and build the postfix expression.
Answered by AI
Add your answer
Q2. 
Mean, Median, and Mode Problem Statement
Given an integer array ARR of size N, you need to compute the following three statistical measures:
1. Mean: Implement the function mean() to calculate the mean o...read more
Ans. 
Implement functions to calculate mean, median, and mode of an integer array.
• Calculate mean by summing all elements and dividing by total count

• Calculate median by sorting array and finding middle element(s)

• Calculate mode by finding element with highest frequency
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

The interviewer started directly by giving coding questions. He gave me two coding questions. I solved using the basic approach first then he asked me to improve my time and space complexity. Then I improved my algorithm.
I was able to solve both the questions in around 55 minutes. The interviewer seemed satisfied. I got a mail for the second interview after 2 days and the interview was scheduled after 2 days.

Q1. 
Reverse Doubly Linked List in Groups Problem
You are provided with a Doubly Linked List consisting of integers and a positive integer 'K', which represents the size of the group. Your task is to modify th...read more
Ans. 
Reverse groups of K nodes in a doubly linked list
• Iterate through the linked list in groups of K nodes

• Reverse each group of K nodes

• Update the pointers accordingly

• Handle cases where the number of remaining nodes is less than K
Answered by AI
Add your answer
Q2. 
String Ka Khel Problem Statement
Ninja is creating a new game ‘String Ka Khel’ for his gaming shop. In this game, players are given ‘N’ strings. The objective is to find the maximum length of strings that...read more
Ans. 
Compute the maximum length of a string that can be formed by joining given strings based on a condition.
• Iterate through each string and store the count of strings ending with 'R' and 'B'.

• Check if there are any strings ending with 'R' and 'B' that can be combined to form a longer string.

• Return the maximum length of the string that can be formed or 0 if no combination is possible.
Answered by AI
Add your answer

Round duration - 90 Minutes
Round difficulty - Easy

The interview started with the interviewer’s introduction and then my introduction and then one coding question. Then he asked me to improve this. So I improved my time complexity. The interviewer was very friendly and helpful. Then we had some discussion on OOPs.

Q1. 
Sum of Minimum and Maximum Elements of All Subarrays of Size K
You are provided with an array containing N integers along with an integer K. Your task is to compute the total sum of the minimum and maximu...read more
Ans. 
Calculate the sum of minimum and maximum elements of all subarrays of size K in an array.
• Iterate through the array and maintain a deque to store the indices of elements in the current window of size K.

• Keep track of the minimum and maximum elements in the current window using the deque.

• Calculate the sum of minimum and maximum elements for each subarray of size K and return the total sum.
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Hard

This was a technical round. The interviewer gave me two coding problems to solve.
And questions on os(Explain Banker’s algorithm with an example, Thrashing, Deadlock, Semaphore, etc), DBMS(ACID properties), oops, and projects.

Q1. 
Family Structure Problem Statement
Aakash belongs to a unique family structure where every male member (M) has a male child first followed by a female child, and every female member (F) has a female child...read more
Ans. 
Determine the gender of the Kth child in the Nth generation based on a unique family structure.
• Every male member has a male child first followed by a female child, and every female member has a female child first followed by a male child.

• Given generation number N and position of the child K, determine the gender of the Kth child in the Nth generation.

• Output 'Male' if the child is male, otherwise 'Female'.

• Start the fami
Answered by AI
Add your answer
Q2. 
Next Greater Element Problem Statement
You are provided with an array or list ARR containing N positive integers. Your task is to determine the Next Greater Element (NGE) for each element in the array.
T...read more
Ans. 
Find the Next Greater Element for each element in an 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 greater element is found or the stack is empty.

• Store the next greater element for each element in a result array.
Answered by AI
Add your answer