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."
Solve Union-Find, Graph, and Stream Problems
Solve the following independent coding problems. 1. Merge Product Categories You are given a list of tuples (productA, productB). Each tuple means the...
Implement Cache and Count Components
You are asked to solve two independent coding problems in this session, each followed by a short discussion. This mirrors a 60-minute Amazon SDE codin...
Compute Latencies and Search Grid Path
You are given two coding tasks from an internship interview. Task 1: Compute Message Latency from CSV Logs Two systems, ComputeA and ComputeB, exchang...
Maximize protected population and bitwise AND
This paired problem evaluates array manipulation and resource-allocation reasoning for maximizing covered population in a constrained-movement scenari...
Find max equal-frequency block count for each prefix
This question evaluates proficiency in string processing, frequency-vector reasoning, and prefix-based partitioning to determine equal-frequency conti...
Maximize protected population with one-step guard shifts
There are n cities in a line (1-indexed). You are given: - population[1..n]: population of each city - unit: a binary string of length n, where unit[i...
Maximize weighted subsequence pairs with wildcards
You are given a string s of length n consisting only of characters '0', '1', and '!'. Each '!' can be replaced by either '0' or '1'. For the final bin...
Find Affected Services After Shutdown
You are given a set of services and their dependency relationships. The input is a hash map where each key is a service name, and the value is a list ...
Find when failures started in log stream
This question evaluates understanding of monotonic sequences and search algorithms (such as binary search), along with algorithmic reasoning about cor...
Implement array and tree traversal tasks
This question evaluates algorithmic problem-solving and data-structure competency, specifically array-based optimization for single-trade profit and t...
Count unique Morse-code word transformations
Given an array of lowercase strings words. Each letter 'a' to 'z' has a corresponding Morse code string (standard 26-letter mapping). A word’s transfo...
Review an existing architecture for risks
This question evaluates an engineer's ability to perform an architecture review, identifying imminent scalability, reliability, operability, and secur...
Find minimum total range-increment to sort
This question evaluates algorithmic problem-solving skills in array manipulation and optimization, focusing on reasoning about range-increment operati...
Implement memcpy with misaligned addresses
This question evaluates a candidate's understanding of low-level memory manipulation, pointer alignment, and the implementation of efficient byte-copy...
Describe a recent innovation you delivered
Behavioral question: “Tell me about a recent innovation you delivered.” Include: - What problem/opportunity you identified - What was novel about your...
Implement integer division without using division
You are given two 32-bit signed integers dividend and divisor. Implement a function that divides dividend by divisor and returns the integer quotient,...
Compute peak parking lot occupancy intervals
You are given logs from a parking lot system. Each log entry has the form: [carId, time, eventType] - carId is an integer identifying a car. - time is...
Design LFU cache with distributed extension
Problem You are asked to design and implement a data structure that behaves like an in-memory cache with a Least Frequently Used (LFU) eviction policy...
Implement nested object path lookup
This question evaluates parsing and traversal of nested maps and arrays, robust error handling for missing keys and out-of-bounds indices, and reasoni...
Check if adding edge creates cycle in digraph
You work with a system that stores items and directed relationships between them (for example, item A points to item B). The relationships form a dire...