← Back to Directory

Amazon interview notes, page 83 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·Online Assessment (OA)

May 2026
Amazon SWE coding round, one question the whole time. It was a data structure design problem and I think I got through it okay but the heap logic took me longer to work out than I'd like to admit.
  • Design a class that tracks a stream of integers and can return the Kth largest element at any point after each new number is added.

“I knew a min-heap of size k was the right move but I fumbled explaining why you'd keep the smallest of the top-k values at the root.”

View Post

Amazon·Software Engineer·Online Assessment (OA)

May 2026
Amazon SDE internship OA with a tricky algorithmic problem about distributing data across two regions while maximizing affinity scores under some pairing constraints. The problem looked approachable at first glance but the rule pairs add a layer that trips you up if you're not careful.
  • You have n data pieces (n is even), each with an affinity value. You need to distribute them between two regions by alternating selections, where each region greedily picks to maximize its total affinity. There are also m pairing rules: if one piece from a pair is picked for a region, the other must go to the next region in the following step. Find the maximum possible affinity sum for RegionA.

“This one messed me up more than I expected.”

View Post

Amazon·Software Engineer·Onsite - Behavioral / Leadership

May 2026
Amazon program manager interview, behavioral round with a classic obstacle/resilience question. Nothing too surprising but it still tripped me up more than I expected.
  • Describe a time you hit major unexpected obstacles while chasing an important goal. How did you handle it, and what would you change looking back?

“I had a decent story ready but the 'what would you do differently' part is where I fumbled.”

View Post

Amazon·Machine Learning Engineer·Technical Phone Screen

May 2026
Amazon ML Engineer interview that was basically one long deep-dive on hyperparameter tuning. Covered everything from the basics up to Bayesian methods, which I was not fully prepared to defend under pressure.
  • Walk me through the main approaches to hyperparameter tuning in machine learning, including how each one works, and the tradeoffs between them in terms of efficiency, parallelizability, and sample efficiency.

“I started with manual search and grid search, which felt fine, but I stumbled when they pushed on why random search often beats grid search empirically.”

View Post

Amazon·Software Engineer·Online Assessment (OA)

May 2026
Amazon OA for a SWE role, got a dynamic programming style problem under the 'Segmentify' branding. The problem dressing was a bit much but the underlying puzzle was interesting once I stripped away the video frame flavor text.
  • Given a binary string of even length, find the minimum number of even-length subsegments (where each subsegment is all 0s or all 1s) such that the total number of character flips needed is minimized first, and then the subsegment count is minimized as a secondary goal.

“The problem is dressed up as a video processing feature but it's really just a string partitioning problem.”

View Post

Amazon·Software Engineer·Technical Phone Screen

May 2026
Amazon coding screen focused on graph traversal. One problem, pretty well-defined, but the underlying complexity sneaks up on you if you're not thinking carefully about how dependencies propagate.
  • Given a set of services that are being shut down, identify all other services that are transitively affected. The input is a hashmap where each key is a service name and each value is a list of services that depend on it. No cycles in the graph.

“I started with BFS which felt right, but I kept second-guessing the direction of the edges.”

View Post

Amazon·Software Engineer·Technical Phone Screen

May 2026
Amazon SWE coding round, one algorithmic question with a follow-up. Pretty standard frequency-counting problem but the heap optimization is where they actually wanted to see if you knew what you were doing.
  • Given an integer array and an integer k, return the k most frequently occurring distinct values. After presenting a basic solution, optimize it using a heap.

“Got the naive approach out fast, count frequencies then sort by count, easy enough.”

View Post

Amazon·Technical Program Manager·Onsite - Behavioral / Leadership

May 2026
Went through a TPM loop at Amazon and got hit with the classic 'tell me about a complex problem you solved' behavioral question. Pretty standard stuff but still easy to fumble if you're not careful about scope.
  • Walk me through a complex problem you solved and how you approached it.

“I had a story ready but rambled too much on the background and ran out of time to explain what I actually did.”

View Post

Amazon·Software Engineer·Technical Phone Screen

May 2026
Amazon SWE interview with a graph/shortest-path problem that looked deceptively clean on the surface but had a lot of moving parts once you started thinking about correctness. One question, but it kept going for a while.
  • You have a start point, an end point, a threshold K, and an undirected graph of bus stations with integer coordinates. Walking costs Manhattan distance; riding any connected sequence of bus stations costs zero. Given that you can walk to a station, ride buses freely across connected stations, then walk to the destination (or just walk the whole way), design an algorithm to determine whether the total walking distance can be kept at or below K. Justify correctness, analyze complexity, and implement a function returning true or false.

“My first instinct was Dijkstra but I second-guessed myself because the bus edges are zero-cost and I wasn't sure if that broke anything.”

View Post

Amazon·Software Engineer·Technical Phone Screen

May 2026
Amazon coding screen for a software engineer role. Pretty standard algorithmic problem, nothing too wild, but the details matter more than they first appear.
  • Given an array of lowercase strings, where each letter maps to a fixed Morse code sequence, return the count of distinct concatenated Morse representations across all words.

“Looked easy and kind of is, but I spent a minute overthinking whether to use a set or a map.”

View Post