Amazon Software Engineer Coding & Algorithms Interview Questions
Practice 177 real Coding & Algorithms interview questions for Software Engineer roles at Amazon.
"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."
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...
Compute fruit spoilage time in a grid
Given an m×n grid representing kitchen cells: 0 for empty, 1 for fresh fruit, and 2 for spoiled fruit. Each minute, any fresh fruit adjacent (up, down...
Compute minimum passes to collect numbers
Question You are given an array shelf of n distinct integers that is a permutation of 1…n. Starting with target = 1, you repeatedly scan shelf from le...
Solve frequency sort and all-pairs sum
Solve frequency sort and all-pairs sum Task 1 — Frequency-based string reorder: Given a string s containing ASCII characters, return a new string whos...
Kth Largest Perfect Binary Subtree
This question evaluates a candidate's ability to combine tree traversal with structural validation, requiring recognition of perfect binary subtrees a...
Detect and Break a Cycle in a Singly Linked List
This question tests practical knowledge of linked list traversal and pointer manipulation, specifically the ability to detect and resolve cycles using...
Minimum Drone Delivery Time on a Ring of Hubs
This question tests a candidate's grasp of circular graph traversal and greedy distance minimization on ring-structured topologies. It evaluates algor...
Drone Circular Route — Minimum Total Travel Cost
This question tests a candidate's ability to apply dynamic programming to combinatorial optimization, specifically the Traveling Salesman Problem (TSP...
Find the Maximum Number of Concurrent Processes
Practice a Amazon coding interview problem focused on find the maximum number of concurrent processes. The prompt emphasizes edge cases, clean impleme...
Find the Closest Version by Date
Practice a Amazon coding interview problem focused on find the closest version by date. The prompt emphasizes edge cases, clean implementation, and ve...
Implement Cache and Rotate Matrix
Solve the following two independent coding tasks. Task 1: Implement an LRU Cache Design a data structure LRUCache that stores integer keys and integer...
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...
Calculate Circular Route Query Distance
You are given a circular route with n stops numbered 0 to n - 1. The array distances has length n, where distances[i] is the clockwise distance from s...
Evaluate IP Access Rules
You are given a list of IPv4 access-control rules. Each rule consists of: - an action: allow or deny - a CIDR block such as 192.168.0.0/16 You are als...
Answer two coding questions (SQL and DP)
This multi-part question evaluates SQL query skills (handling distinct values, aggregation and edge-case NULL results) and algorithmic proficiency in ...
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...
Merge overlapping and adjacent ranges
Given an unsorted list of integer ranges represented as half-open intervals [start, end) with start < end, merge all overlapping or directly adjacent ...
Compute reachability and minimal-time same-type scheduling
1) Given four integers a, b, c, d (1 <= a, b, c, d <= 1000), you may perform the following operations any number of times and in any order: (a, b) -> ...
Check path in N-ary tree
Given the root of an N-ary tree and a sequence of integers path[0..k-1], determine whether there exists a path starting at the root whose node values ...
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...