Amazon Software Engineer Interview Questions
Amazon Software Engineer interview questions typically assess both algorithmic craftsmanship and fit with Amazon’s culture. What’s distinctive is the dual emphasis: expect intense coding and problem-solving rounds (data structures, algorithms, complexity and correct edge-case handling), a system-design evaluation for more senior roles, and behavioral deep-dives tied to Amazon’s Leadership Principles. The interview loop often includes an online assessment or phone screen, followed by a multi-interviewer loop that features a Bar Raiser whose role is to ensure high hiring standards. Clear communication, tradeoff reasoning, and testable, clean code are repeatedly evaluated. For interview preparation, focus on three threads: timed coding practice on medium-to-hard problems with careful explanation of complexity and edge cases; concise STAR-format behavioral stories that map directly to Leadership Principles and show impact; and system-design sketches for senior levels that justify choices around scalability, availability, and cost. Run mock interviews to practice speaking clearly, articulate tradeoffs, and rehearse writing and testing code under time pressure. Recruiters will guide scheduling, but sustained, focused practice gives the best chance to demonstrate both technical depth and cultural fit.

"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."
Insert and merge an interval
You are given a list of pairwise non-overlapping closed intervals [si, ei] sorted by start time, and a new interval [s, e]. Insert [s, e] into the lis...
Detect cycle in a directed graph
Given a directed graph represented by an adjacency list with n vertices and m edges, determine whether the graph contains a cycle. Describe and implem...
Search target in unknown-length sorted array
You have read-only access to a sorted, increasing array-like interface of unknown length that supports get(i), which returns a valid integer for in-bo...
Find all pairs summing to target in sorted array
Given a non-decreasing array of integers nums and an integer target, return all unique pairs of indices (i, j) with i < j such that nums[i] + nums[j] ...
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...
Count regions with DFS
Given an m x n grid of 0s and 1s, count the number of connected regions consisting of 1s using depth-first search (4-directional adjacency). Return th...
Find longest segment with endpoints > interior
Given an integer array nums, find the length of the longest contiguous segment [i..j] (j−i+1 ≥ 2) such that both endpoints are strictly greater than e...
Find minimum days to deliver all orders
You manage N delivery centers labeled 1..N and an array orderCityList where each element is the destination city of one order (city IDs are in 1..N). ...
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...
Implement DFS and tree algorithms
Part 1 (DFS on graph): Given an undirected graph with n nodes labeled 0..n-1 and an edge list, implement a function that returns all connected compone...
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 tree left/right views via BFS and DFS
Given a binary tree, output the left view and right view: for each depth, the first node visible from the left and the first node visible from the rig...
Maximize equal values via one subarray shift
Given an integer array A of length n, you may perform at most one operation: choose any contiguous subarray A[l..r] and add an integer Δ (which may be...
Maximize points with limited coworker skips
You and a coworker must unload a sequence of warehouses. For warehouse i there are c[i] items (non‑negative integers). Turns alternate starting with y...
Select maximum tasks before deadlines
Select maximum tasks before deadlines You are given a set of tasks, each with a positive duration and a deadline (lastDay). You may schedule tasks in ...
Maximize stock profit with constraints
Maximize stock profit with constraints Given an array prices of daily stock prices, you may make at most two complete transactions (buy then sell). Af...
Compute shortest path with obstacles
Compute shortest path with obstacles You are given an m×n grid with nonnegative cell costs and blocked cells marked '#'. You may move up, down, left, ...
Design a hierarchical locking tree
Design a hierarchical locking tree Design a LockingHierarchy data structure over a rooted tree of N nodes labeled 0..N-1, initialized with an integer ...
Implement LRU cache with O(1) ops
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. ...
Validate 9x9 grid in one pass
Validate 9x9 grid in one pass Given a partially filled 9x9 board using digits '1'–'9' and '.' for empty cells, determine whether the current configura...