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."
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...
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...
Maintain real-time top-K products from events
Design a data structure/class that ingests a stream of product events and returns the current top‑K products at any time. Events include {timestamp, p...
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...
Implement array and tree traversal tasks
You are interviewing for a storage/infra-leaning role. Solve the following coding tasks and be ready to discuss time/space complexity and edge cases. ...
Serialize and deserialize a binary tree
Problem Design two functions to serialize and deserialize a binary tree. - Serialize: convert a binary tree into a single string. - Deserialize: recon...
Find two numbers that sum to target
Given an integer array nums of length n and an integer target, return the indices (i, j) (0-based) of two distinct elements such that nums[i] + nums[j...
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(...
Solve array duplicates and two-type subarray
Coding questions Solve the following array problems. Problem 1: Check for duplicates Given an integer array nums, return true if any value appears at ...
Compute product excluding index without division
Given an integer array nums, return an array ans where ans[i] equals the product of all elements of nums except nums[i], without using division. Achie...
Implement LRU cache with O(1) ops
Design and implement a fixed-capacity cache supporting get(key) -> value and put(key, value) in O( 1) average time. When capacity is reached, evict th...
Design 2D DP on a DAG
Given a directed acyclic graph G(V, E) with N nodes, M edges, a designated source s, and an integer L, design a 2D dynamic program dp[u][k] that compu...
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...
Generate primes up to n efficiently
Implement a function that returns all prime numbers in the inclusive range 1..n. Requirements: handle n up to 10^7 efficiently (time and memory); retu...
Solve stock, BFS path, and merge intervals
Solve three coding problems; justify complexity and corner cases. A) Best Time to Buy/Sell Stock (one transaction): Given prices[0..n-1] (integers), r...
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...
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...
Validate a training courses catalog
You are given a catalog of training courses. Each course has: - a unique course_id - a list of prerequisite course IDs prereqs (possibly empty) Write ...
Implement nested object path lookup
Implement a function get(obj, path) for a nested data structure composed only of maps and arrays. Path rules: - . accesses a map key - [i] accesses an...
Solve server updates and grid inconvenience minimization
1) You are given an integer array server of length n, where server[i] is the number of requests the i-th server can process. Over multiple days, you r...