← Back to Directory

Amazon interview notes, page 118 of 159

FAANG / Big Tech

Most of these Amazon write-ups come from Software Engineers (1,092), then Data Scientists (182) and Product Managers (165). The most reported rounds are the technical phone screen (618), the behavioral / leadership round (309), the online assessment (228) and the system design round (159).

1581 interview notes · updated Oct 2026

Amazon·Software Engineer·Technical Phone Screen

Jun 2026
Amazon SWE interview that went pretty deep into dynamic programming. The core problem was a classic target sum variant but they pushed hard on implementation tradeoffs and edge cases, which I wasn't fully ready for.
  • Given an array of non-negative integers and a target value T, assign a + or - sign to each number and count how many distinct sign assignments produce an expression that equals T.
  • How does your solution handle arrays that contain zeros, and what happens when the total sum of the array is very large?
  • Can you modify your solution to return one actual valid sign assignment, not just the count?

“I started with recursion, which felt natural, but then they asked me to compare it against memoization and a full iterative DP solution.”

View Post

Amazon·Software Engineer·Online Assessment (OA)

Jun 2026
Got an Amazon SWE online assessment with a server memory optimization problem. Pretty algorithmic, nothing behavioral, just code and figure it out.
  • Given an array of server memory sizes, select the maximum total memory for Primary servers, where each Primary must be paired with a Backup server of equal or greater memory, and the total number of servers used must be even.

“The key click for me was sorting the array descending and then pairing adjacent elements, treating the larger as primary and the smaller as backup.”

View Post

Amazon·Software Engineer·Onsite - Behavioral / Leadership

Jun 2026
Behavioral screen at Amazon, pretty standard leadership principles territory. One question, not much to it, but it tripped me up more than I expected.
  • Tell me about a time you helped a struggling team member turn their performance around.

“I had a story ready but fumbled the delivery.”

View Post

Amazon·Software Engineer·Online Assessment (OA)

Jun 2026
Amazon SWE online assessment with a sliding window string problem. Pretty standard stuff for an OA but the streaming framing threw me off a bit at first.
  • Given a string S and a target string T, find all starting indices in S where a substring of length equal to T is an anagram of T.

“The streaming angle messed with my head more than it should have.”

View Post

Amazon·Software Engineer·Onsite - Behavioral / Leadership

Jun 2026
Amazon software engineer interview with a single deep-dive question about your most complex project. Pretty intense if you haven't thought through your story carefully beforehand.
  • Walk me through the most complex project you've worked on. What made it complex, how did you scope it, what technical decisions did you make, what obstacles came up, and what did you actually deliver?

“This question sounds open-ended until you realize they want you to hit like four different dimensions: scale, ambiguity, cross-team stuff, and technical depth.”

View Post

Amazon·Software Engineer·Onsite - System Design / Architecture

Jun 2026
Amazon SWE onsite round that split evenly between an object-oriented design problem for a pizza ordering system and a leadership principles story. The OOD half had more depth than I expected, and the LP half felt like it mattered just as much, which I wasn't fully prepared for.
  • Design a pizza ordering and fulfillment system end-to-end, covering the menu, order placement, kitchen workflow, and delivery handoff.
  • Walk through the full order state machine, including every transition and what event triggers each one.
  • How would you model the kitchen station as a throughput bottleneck, and how does it handle concurrent orders?
  • How would you extend this design to support multiple store locations with geo-based order routing?
  • Where should pricing logic live in your design, and how would you support promo codes or loyalty discounts without modifying the core menu classes?
  • Tell me about a time you delivered a project under a tight deadline, especially one that required coordinating across teams.

“I jumped straight into classes and forgot to map out the full flow first.”

View Post

Amazon·Product Manager·Onsite - Product Sense / Strategy

Jun 2026
Amazon PM interview with a classic metrics disaster scenario. One question, pretty open-ended, and I spent way too long trying to sound structured instead of just thinking through it out loud.
  • Amazon orders are down 25% week over week. What do you do?

“I jumped straight to external factors (competitor promo, seasonality) and the interviewer just kind of waited.”

View Post

Amazon·Software Engineer·Online Assessment (OA)

Jun 2026
Amazon SWE online assessment with a shipping cost calculation problem. Pretty straightforward tiered pricing logic but the input parsing tripped me up more than I expected.
  • Given a list of item weights and a tiered pricing table with weight ranges and rates, calculate the total shipping cost for an order, rounded to two decimal places.

“The logic itself isn't hard once you see it, each item's weight maps to exactly one rate bracket and you multiply and sum.”

View Post

Amazon·Software Engineer·Online Assessment (OA)

Jun 2026
Amazon SWE online assessment with a greedy algorithm problem. Pretty compact problem statement but the tricky part was figuring out the right greedy strategy to minimize cumulative overhead.
  • You're given a string containing '0', '1', and '?' characters. Replace every '?' with either '0' or '1' to minimize the total sum of overheads across all positions.

“Greedy problem but I spent way too long second-guessing myself on what 'overhead at a position' actually meant before it clicked.”

View Post

Amazon·Software Engineer·Online Assessment (OA)

Jun 2026
Amazon SWE online assessment with a simulation-style array problem. Nothing behavioral, just code. The problem looked manageable at first glance but the edge cases in the decrement logic had me second-guessing my implementation the whole way through.
  • Given an integer array and a number of operations n, repeatedly find the current min and max, record their sum, then decrement the max by 1. Return all n sums.

“My first instinct was a sorted structure and i went with a max-heap plus tracking the global min separately.”

View Post