← Back to Directory

Amazon interview notes, page 124 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·Product Manager·Onsite - Behavioral / Leadership

Jun 2026
Amazon PM behavioral round, pretty much what you'd expect from them. One question, classic leadership principles territory.
  • Tell me about your biggest failure.

“I fumbled this a bit.”

View Post

Amazon·Software Engineer·Online Assessment (OA)

Jun 2026
Amazon OA for a SWE role, just one algorithmic problem about truck packing. Pretty clean problem statement but the constraints make it trickier than it first looks.
  • Given a list of parcel counts per product category, a truck capacity, and a per-product-type load limit per truck, find the minimum number of trucks needed to ship everything.

“I stared at this for a bit before realizing the two constraints interact in a non-obvious way.”

View Post

Amazon·Software Engineer·Onsite - System Design / Architecture

Jun 2026
Amazon system design round focused entirely on ML, and they wanted the full picture from one project, not a highlight reel. Pretty grueling if you haven't actually shipped something end-to-end.
  • Pick a machine learning project from your resume and walk through the entire lifecycle: how you defined the problem and measured success, where the data came from and how it was labeled, what features and model you chose, how training was set up and on what infrastructure, how you evaluated offline, what your A/B test plan looked like, how you monitored in production, what could go wrong, any privacy or compliance constraints, and how you'd think about cost and scale.

“This is basically one question that takes 45 minutes if you let it.”

View Post

Amazon·Data Scientist·Technical Phone Screen

Jun 2026
Amazon data scientist round, one coding problem the whole time. Graph traversal, which I wasn't expecting for a DS role but here we are.
  • Given a social network modeled as an undirected graph with millions of users, implement an iterative BFS to find the minimum number of hops between two users. Then extend it to also return one of the actual shortest paths.

“The first part went fine, queue plus visited set, pretty standard.”

View Post

Amazon·Product Manager·Technical Phone Screen

Jun 2026
Amazon interview for a role involving TV show watch time metrics. Not much to go on from what was shared, but it seems like a product analytics or PM-type screen.
  • How would you measure the success of a TV show's watch time on a streaming platform?

View Post

Amazon·Software Engineer·Onsite - Coding / Algorithms

Jun 2026
Amazon SWE coding round with one algorithmic problem about detecting impossible travel across user events. The problem was well-constructed but I underestimated how much the sorting and sliding window part would matter under time pressure.
  • Given a list of user access events (each with a user ID, region, and timestamp) and a threshold k, find all pairs of events from the same user that come from different regions within a time window strictly less than k. Return the index pairs sorted by (i, j) with i < j.

“My first instinct was brute force, compare every pair per user, and for small inputs that works fine.”

View Post

Amazon·Software Engineer·Onsite - Behavioral / Leadership

Jun 2026
Behavioral round at Amazon for a software engineering role. Two questions, both pretty classic leadership principle territory. Nothing technically hard but I definitely fumbled the second one.
  • Tell me about a time you went out of your way to help a peer or unblock a teammate.
  • Describe a conflict you had with a colleague and how you resolved it.

“Had a decent story for this one.”

View Post

Amazon·Software Engineer·Technical Phone Screen

Jun 2026
Amazon SWE interview with two coding problems back to back. One was a known LeetCode problem and the other was a custom scheduling problem that felt more involved than it looked.
  • Given four integers a, b, c, d, starting from point (a, b) you can repeatedly apply either (x, y) → (x+y, y) or (x, y) → (x, x+y). Can you determine if it's possible to reach the point (c, d)?
  • Given an array of memory requirements per task, an array of task types, and a max memory limit, find the minimum time to complete all tasks. Two tasks can run in parallel only if they share the same type and their combined memory doesn't exceed the limit. Each task takes one unit of time.

“Recognized it as the LeetCode reaching points problem pretty fast, which was a relief.”

View Post

Amazon·Software Engineer·Technical Phone Screen

Jun 2026
Amazon SWE coding round, one question: implement an LRU cache. Short and to the point.
  • Implement an LRU (Least Recently Used) cache with the standard get and put operations.

“Classic question but the pressure of doing it live always makes the doubly linked list part messier than it looks on paper.”

View Post

Amazon·Software Engineer·Technical Phone Screen

Jun 2026
Amazon SWE interview with a coding question that looked straightforward until you actually thought about it. The problem had a lot of moving parts and I don't think I handled all of them cleanly in the time I had.
  • Given a large, unordered log of web access events where each entry is a (user_id, ISO 8601 timestamp) pair, identify which users are returning visitors, meaning they appear on at least two distinct calendar days. Walk through how you'd handle timezone normalization, memory constraints for large logs, algorithmic complexity, and edge cases like events near midnight or duplicate entries.

“I started with the obvious approach: collect all dates per user into a set and check if the set size is >= 2.”

View Post