Amazon backend engineer interviews typically focus on APIs, databases, system design, concurrency, caching, and data structures.
All Roles
Software Engineer
Backend Engineer
Frontend Engineer
Full Stack Engineer
Mobile Engineer
Data Engineer
Data Scientist
ML Engineer
DevOps Engineer
DevOps Engineer
Product Manager
SRE
Security Engineer
Engineering Manager
Data Analyst
UX/UI Designer
QA Engineer
coding
Hard
Verified Question
#1
1. Binary Tree Cameras
Category: Binary tree coding problemYou are given the root of a binary tree. You need to install the minimum number of cameras on the tree nodes such that every node in the tree is...Input: Binary tree
Output: Integer
coding
Hard
Verified Question
#2
2. [CodeSignal] Warehouse Emergency Deliveries
Category: Array coding problemAmazon has opened a new warehouse recently. There are no products in the warehouse currently. The warehouse is under inspection for
n days. The...Input: ArrayOutput: Integer
coding
Hard
Verified Question
#3
3. [CodeSignal] Permutation Sorter
Category: Combinatorics coding problemAmazon engineers are testing a new tool, the Permutation Sorter, built to reorder sequences using limited operations. Given a permutation of...Input: Integer(s)
Output: Integer
coding
Hard
Verified Question
#4
4. [CodeSignal] Maximum Product Rating
Category: Array coding problemThe engineers at Amazon are working on a new rating system for their products. For each product, an array
customer_rating is maintained for the...Input: ArrayOutput: Computed result
coding
Medium
Verified Question
#5
5. [CodeSignal] Drone Hub Travel
Category: Array coding problemAmazon is expanding its next-generation drone delivery network, consisting of
m hubs arranged in a circular ring (Hub 1 is adjacent to Hub m)....Input: ArrayOutput: Computed result
coding
Medium
Verified Question
#6
6. [CodeSignal] Minimum Security Groups
Category: Array coding problemA financial services company has requested AWS for a private deployment of its cloud network. There are
n servers in the network where the security...Input: ArrayOutput: Integer
coding
Medium
Verified Question
#7
7. [CodeSignal] Maximum Secure Deliveries
Category: Array coding problemYou are given an array
deliveryLogs of size n, where each element represents the number of parts delivered in the i-th log. You are also given...Input: ArrayOutput: Integer
coding
Medium
Verified Question
#8
8. Maximum Interval Overlap
Category: Interval-based coding problemYou are given a list of closed intervals on the number line, where each interval
[start, end] includes both endpoints. Find the maximum number of...Input: ListOutput: Integer
coding
Hard
dynamic programming
#1
1. [OA] Longest Increasing Subsequence — Optimize Amazon's Product Variant Matching
In Amazon's catalog, we need to efficiently match variants of products based on their attributes.
Problem statement: Given an array of integers
Input:
Output:
Explanation: The longest increasing subsequence is
-
-
Problem statement: Given an array of integers
nums, represents product variant IDs, find the length of the longest increasing subsequence. Assume each variant ID is a unique identifier.Example 1: Input:
nums = [10, 9, 2, 5, 3, 7, 101, 18]Output:
4 Explanation: The longest increasing subsequence is
[2, 3, 7, 101], which has a length of 4.Constraints:-
1 <= nums.length <= 2500-
-10^4 <= nums[i] <= 10^4.
coding
Hard
graph
#2
2. [OA] Dijkstra’s Algorithm — Optimize Amazon's Delivery Route
Amazon needs efficient delivery routing to ensure timely package delivery across its vast logistics network.
Problem statement: Given a graph represented by an adjacency matrix
Input:
Output:
Explanation: The shortest distance from hub 0 to hub 1 is 1, to hub 2 is 3, and to hub 3 is 6.Constraints:
-
-
-
Problem statement: Given a graph represented by an adjacency matrix
graph, where each element represents the distance between two delivery hubs, implement a function to determine the shortest path from a starting hub to all other hubs. Return an array containing the shortest distance from the start hub to each hub.Example 1: Input:
graph = [[0, 1, 4, inf], [1, 0, 2, 6], [4, 2, 0, 3], [inf, 6, 3, 0]], start = 0Output:
[0, 1, 3, 6] Explanation: The shortest distance from hub 0 to hub 1 is 1, to hub 2 is 3, and to hub 3 is 6.Constraints:
-
1 <= number of hubs <= 100-
0 <= graph[i][j] <= 10^5-
graph[i][i] == 0.Related Amazon Backend Engineer interview prep
Start practicing Amazon questions
Sign up for free to access walkthroughs, AI-generated questions, and more.
Get Started Free