Amazon Coding & Algorithms Interview Questions
Practice 689 real Amazon interview questions for 2026. Covers all top categories — Coding & Algorithms, Behavioral & Leadership, Machine Learning, Data Manipulation (SQL/Python), and System Design — across Software Engineer, Data Scientist, Machine Learning Engineer, Product Manager, and Business Intelligence Engineer roles. Real Amazon interview questions from actual interviews with detailed solutions; use this collection for interview preparation that emphasizes shipping at scale, measurable impact, and the company’s Leadership Principles. Expect coding-heavy assessments for Software Engineer candidates: frequent tree and dynamic-programming problems, two-array optimization patterns, nested object/path lookups, and system-design prompts that mirror product flows (online Minesweeper, pizza-ordering, credit-card and shipping/cost systems), plus leadership and collaboration behavioral prompts. Data Scientist rounds concentrate on experimentation and metrics (A/B design, hand p-values, D7 retention SQL), RAG/recommender evaluation, and product-impact analyses. ML Engineer questions focus on production model design, LLM/agent concepts, reliability (cold start, training stability, online vs offline gaps), and large-scale detection pipelines. PM interviews stress customer-obsessed stories, ambiguity, Alexa product launches, and domain-specific data pipelines. Prepare with timed coding practice, end-to-end experiment writeups, STAR stories framed to Leadership Principles, and mock system-design sessions.
"I got asked a hardcore MCM DP question and I saw it on PracHub as well. Solved that question in 5 minutes. Without PracHub I doubt I could solve it in 5 hours. Though somehow didn't get hired, perhaps I guess I solved it too fast? /s"
"Believe me i'm a student here jn US. Recently interviewed for MSFT. They asked me exact question from PracHub. I saw it the night before and ignored it cause why waste time on random sites. I legit wanna go back and redo this whole thing if I had chance. Not saying will work for everyone but there is certainly some merit to that website. And i'm gonna use it in future prep from now on like lc tagged"
"10 years of experience but never worked at a top company. PracHub's senior-level questions helped me break into FAANG at 35. Age is just a number."
"I was skeptical about the 'real questions' claim, so I put it to the test. I searched for the exact question I got grilled on at my last Meta onsite... and it was right there. Word for word."
"Got a Google recruiter call on Monday, interview on Friday. Crammed PracHub for 4 days. Passed every round. This platform is a miracle worker."
"I've used LC, Glassdoor, and random Discords. Nothing comes close to the accuracy here. The questions are actually current — that's what got me. Felt like I had a cheat sheet during the interview."
"The solution quality is insane. It covers approach, edge cases, time complexity, follow-ups. Nothing else comes close."
"Legit the only resource you need. TC went from 180k -> 350k. Just memorize the top 50 for your target company and you're golden."
"PracHub Premium for one month cost me the price of two coffees a week. It landed me a $280K+ starting offer."
"Literally just signed a $600k offer. I only had 2 weeks to prep, so I focused entirely on the company-tagged lists here. If you're targeting L5+, don't overthink it."
"Coaches and bootcamp prep courses cost around $200-300 but PracHub Premium is actually less than a Netflix subscription. And it landed me a $178K offer."
"I honestly don't know how you guys gather so many real interview questions. It's almost scary. I walked into my Amazon loop and recognized 3 out of 4 problems from your database."
"Discovered PracHub 10 days before my interview. By day 5, I stopped being nervous. By interview day, I was actually excited to show what I knew."
"I recently cleared Uber interviews (strong hire in the design round) and all the questions were present in prachub."
"The search is what sold me. I typed in a really niche DP problem I got asked last year and it actually came up, full breakdown and everything. These guys are clearly updating it constantly."
Minimize operations to reduce price difference
You are managing an inventory of products and want to adjust their prices. There are n products. The price of the i-th product is given by an integer ...
Maximize memory capacity with primary-backup servers
You are helping to optimize the capacity of a cloud system. There are n servers, where n is always even. The memory capacity of the i-th server is giv...
Find earliest time password becomes irrecoverable
You are given a password string of length n and an attack order array attackOrder[1..n], a permutation of 1..n. At second i (1-indexed), the virus rep...
Find returning users from access logs
Given an unordered log of web access events, identify which users are returning (i.e., they have visited on at least two different calendar days). Eac...
Compute grid shortest path with obstacles
You are given an m x n grid of integers where cells with value -1 represent obstacles and all other cells are traversable. Starting at (0, 0) and targ...
Detect cycles in lists and graphs
Given a singly linked list, determine whether it contains a cycle. Implement an O( 1)-space algorithm and explain the intuition and correctness. Follo...
Solve jumps and anagram-similarity problems
You are given two independent tasks. Task A (Maximize calories over jumps): - There are n blocks with integer heights height[i] ≥ 0. - You start on th...
Find returning users from access logs
Given a large user access log, parse it and identify which user_ids are returning customers—i.e., they have at least one visit on two or more distinct...
Explain work-simulation approach under ambiguity
Behavioral: Prioritizing and Delivering Under Ambiguity in a Time-Boxed Simulation Context You are a software engineer in a technical screen. You are ...
Maximize optional tasks under daily limit
You are given an integer limit and two integer arrays required and optional of length n. For each day i, you must schedule required[i]. If time remain...
Insert and merge an interval
You are given a list of pairwise non-overlapping closed intervals [si, ei] sorted by start time, and a new interval [s, e]. Insert [s, e] into the lis...
Detect cycle in a directed graph
Given a directed graph represented by an adjacency list with n vertices and m edges, determine whether the graph contains a cycle. Describe and implem...
Search target in unknown-length sorted array
You have read-only access to a sorted, increasing array-like interface of unknown length that supports get(i), which returns a valid integer for in-bo...
Find all pairs summing to target in sorted array
Given a non-decreasing array of integers nums and an integer target, return all unique pairs of indices (i, j) with i < j such that nums[i] + nums[j] ...
Compute tree diameter
Given a (potentially large) binary tree, compute its diameter (the number of edges on the longest path between any two nodes). Implement an O(n) solut...
Count regions with DFS
Given an m x n grid of 0s and 1s, count the number of connected regions consisting of 1s using depth-first search (4-directional adjacency). Return th...
Implement binary search lower/upper bounds
Question Given a non-decreasing sorted integer array nums of length n and a target value, implement two functions using binary search: 1. lower_bound(...
Find longest segment with endpoints > interior
Given an integer array nums, find the length of the longest contiguous segment [i..j] (j−i+1 ≥ 2) such that both endpoints are strictly greater than e...
Find minimum days to deliver all orders
You manage N delivery centers labeled 1..N and an array orderCityList where each element is the destination city of one order (city IDs are in 1..N). ...
Compute rightmost-smaller delay times
Given an integer array priorities, define delay[i] as the distance to the rightmost index j > i such that priorities[j] < priorities[i]; if no such in...