Amazon Software Engineer Interview Questions, Process, and Tips

Q1. What are your strengths and weaknesses?
Add your answer
Q2. Tell me about yourself.
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Q1. 
Sum Between Zeroes Problem Statement
Given a singly linked list containing a series of integers separated by the integer '0', modify the list by merging nodes between two '0's into a single node. This mer...read more
Ans. 
Merge nodes between zeroes in a linked list to store the sum of included nodes.
• Traverse the linked list and keep track of sum between zeroes

• Merge nodes between zeroes by updating the sum in the merged node

• Handle edge cases like empty list or single node between zeroes

• Ensure the list starts and ends with a zero
Answered by AI
Add your answer
Q2. 
Minimum Cost to Buy Oranges Problem Statement
You are given a bag of capacity 'W' kg and a list 'cost' of costs for packets of oranges with different weights. Each element at the i-th position in the list...read more
Ans. 
Find the minimum cost to purchase a specific weight of oranges given the cost of different weight packets.
• Iterate through the list of costs and find the minimum cost to achieve the desired weight

• Keep track of the total cost while considering available packet weights

• Return -1 if it is not possible to buy exactly the desired weight
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Q1. 
Connecting Ropes with Minimum Cost
You are given 'N' ropes, each of varying lengths. The task is to connect all ropes into one single rope. The cost of connecting two ropes is the sum of their lengths. Yo...read more
Ans. 
Given 'N' ropes of varying lengths, find the minimum cost to connect all ropes into one single rope.
• Sort the lengths of ropes in ascending order.

• Keep connecting the two shortest ropes at each step.

• Add the cost of connecting the two ropes to the total cost.

• Repeat until all ropes are connected.

• Return the total cost as the minimum cost to connect all ropes.
Answered by AI
Add your answer
Q2. What are the ACID properties in DBMS?
Ans. 
ACID properties in DBMS ensure data integrity and consistency in transactions.
• Atomicity: All operations in a transaction are completed successfully or none at all.

• Consistency: Data remains consistent 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 system failures.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

It was a technical interview round which was online in Amazon chime. The first question was- Tell me about yourself. Then he asked about my technical skills like- in which language I code, what all topics do I know. Then he asked me questions on networking
 

Q1. 
Longest Common Subsequence Problem Statement
Given two strings, S and T with respective lengths M and N, your task is to determine the length of their longest common subsequence.
A subsequence is a seque...read more
Ans. 
The task is to find the length of the longest common subsequence between two given strings.
• Use dynamic programming to solve this problem efficiently.

• Create a 2D array to store the lengths of common subsequences of substrings.

• Iterate through the strings to fill the array and find the longest common subsequence.

• Example: For strings 'abcde' and 'ace', the longest common subsequence is 'ace' with a length of 3.
Answered by AI
Add your answer

Round duration - 100 minutes
Round difficulty - Medium

This was the second technical round. 
 

Q1. 
Reverse a Singly Linked List
Given a singly linked list of integers, your task is to return the head of the reversed linked list.
Explanation:
Reverse a given singly linked list so that the last element be...read more
Ans. 
Reverse a singly linked list of integers.
• Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.

• Keep track of the current, previous, and next nodes while traversing the list.

• Update the head of the linked list to be the last node encountered during traversal.
Answered by AI
Add your answer
Q2. 
Reverse Linked List Problem Statement
Given a singly linked list of integers, your task is to return the head of the reversed linked list.
Example:
Input:
The given linked list is 1 -> 2 -> 3 -&g...read more
Ans. 
Reverse a singly linked list of integers and return the head of the reversed linked list.
• Traverse the linked list and reverse the pointers to point to the previous node instead of the next node

• Use three pointers - prev, current, and next to reverse the linked list

• Update the head of the reversed linked list to be the last element of the original linked list

• Example: Input: 1 -> 2 -> 3 -> 4 -> NULL, Output: 4
Answered by AI
Add your answer

Q1. What is your family background?
Add your answer
Q2. Why are you looking for a change?
Add your answer
Q3. Tell me about yourself.
Add your answer

E-commerce