Amazon Coding & Algorithms Interview Questions
Amazon Coding & Algorithms interview questions focus heavily on data structures, algorithmic problem solving, and clear on-the-spot implementation. What’s distinctive is the combination of speed and depth: interviewers evaluate correctness, time and space complexity, edge-case handling, and the candidate’s ability to communicate a stepwise approach under time pressure. Expect array/string manipulation, trees/graphs, hashing, dynamic programming, and occasional system- or design-lite prompts for senior roles, with behavioral ties to Amazon’s leadership principles sometimes woven into technical rounds. Typical loops begin with one or two timed phone screens followed by an onsite or virtual loop of multiple interviews that mix pure coding, design (for higher levels), and behavioral assessment; a bar-raiser may appear to ensure hiring standards. For effective interview preparation, practice timed coding problems across core topics, run mock interviews that force you to verbalize decisions, write clean, testable code, and rehearse concise STAR-style stories that highlight ownership and impact. Developing pattern recognition for problem types and routinely reviewing complexity and edge cases will make your responses faster, safer, and more persuasive.

"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."
Build a BFS Web Crawler
Implement a web crawler for a single website. You are given: - A starting URL startUrl - A function fetch(url) that returns the HTML content of a page...
Find all cells reachable by downhill flow
Problem You are given an m x n grid heights, where heights[r][c] is the elevation of cell (r, c). A drop of water is placed at a starting cell start =...
Solve subset-count and kth-factor problems
Two Independent Tasks A) Maximum Count Under Sum Constraint You are given an integer array arr and an integer budget n. Return the maximum number of e...
Determine reachability and optimize task scheduling
Question LeetCode 780. Reaching Points: Given four integers a, b, c, d (1 <= a, b, c, d <= 1000). Starting from (a, b) you may repeatedly apply either...
Solve Algorithmic Challenges in Online Coding Assessments
Scenario Online assessment requiring implementation of common algorithmic problems. Question Given an array of integers and a target, return indices o...
Implement memcpy with misaligned addresses
Implement a C-style memcpy that correctly handles misaligned source/destination addresses. Task Write a function: `c void my_memcpy(void dst, const vo...
Find top-k lottery winners by spending
You are building a lottery system where each user’s chance of winning is linearly proportional to how much they spent (e.g., user with spend s has wei...
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...
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...
Determine string buildability from dictionary
Given a non-empty string s and a list of non-empty words dict, determine whether s can be formed by concatenating words from dict with unlimited reuse...
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...
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...
Optimize with a cache/hash map
Question This is a follow-up to your existing implementation (for example, a script that repeatedly resolves file paths or parses license strings into...
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 ...
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...
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...
Validate 9x9 grid in one pass
Given a partially filled 9x9 board using digits '1'–'9' and '.' for empty cells, determine whether the current configuration is valid under Sudoku rul...
Solve interval deletion and GCD subarray problems
1) Given n closed intervals [li, ri] on a number line, remove the fewest intervals so that among the remaining intervals there exists at least one int...
Count partitions and equal-cost packages
Question Given a string itemCategories, count the number of ways to partition it into exactly two contiguous non-empty substrings (a prefix and a suff...
Find when failures started in log stream
You are given an array of log entries sorted by timestamp ascending. Each log entry contains: - timestamp (monotonic increasing) - status ∈ {OK, FAIL}...