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."
Sort characters by frequency
Given an ASCII string s, reorder its characters in decreasing order of frequency. If multiple characters share the same frequency, break ties by ascen...
Find LCA in a BST
Find LCA in a BST Given the root of a binary search tree and two keys p and q, return the value of their lowest common ancestor (the deepest node whos...
Compute optimal locker placement with obstacles
Compute optimal locker placement with obstacles Given house coordinates H = {(xi, yi)} and tree coordinates T = {(xj, yj)} on a 2D integer grid, choos...
Implement two array-cost minimization algorithms
Implement two array-cost minimization algorithms that appeared back-to-back in an AWS SDE online assessment. Each can be solved independently. Part 1 ...
Solve Rotting Oranges and Bus Walk Reachability
Question LeetCode 994. Rotting Oranges. 2) Given start and end grid coordinates, an integer k (maximum walking distance), and a bidirectional graph of...
Solve Search Insert Position Using Binary Search
Scenario Live coding round for an Amazon Applied Scientist position; candidate must solve LeetCode 35 (Search Insert Position) without helper librarie...
Determine Length of Longest Unique Substring
Scenario Online assessment: coding portion that follows the SQL questions. Question Implement a function that, given a string s, returns the length of...
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...
Solve median extremes and segment flips
Solve median extremes and segment flips Part A — Sliding-window median extremes: - Input: an integer k (1 ≤ k ≤ n) and an array nums of length n. - Fo...
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...
Implement Multi-Head Attention from Scratch in NumPy
This coding question tests a machine learning engineer's understanding of Transformer internals by requiring a from-scratch NumPy implementation of mu...
Implement Top-p (Nucleus) Sampling in NumPy
This coding question tests practical implementation of top-p (nucleus) sampling, a core decoding strategy in large language models. It evaluates NumPy...
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...
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...
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...