← Back to Directory

Amazon interview notes, page 33 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

Apr 2026
Amazon SWE interview with a combined OOD and coding round. The core problem was building a single-machine Pub/Sub system from scratch, with priority queues thrown in to keep things interesting. Solid design problem but it moves fast.
  • Design and implement a simplified single-machine Pub/Sub system where users can subscribe to topics, with support for message priority.

“The priority part is what gets you.”

View Post

Amazon·Software Engineer·Online Assessment (OA)

Apr 2026
Amazon SWE online assessment with a math-heavy array problem. The kind of question where you need to really think about GCD properties before you even touch the code.
  • Given an integer array and a budget of k replacements, find the minimum possible 'weakness factor', defined as the length of the longest contiguous subarray whose GCD is greater than 1. You can replace any element with any value up to k times.

“Took me a while to even parse what 'weakness factor' meant in this context.”

View Post

Amazon·Software Engineer·Online Assessment (OA)

Apr 2026
Amazon SWE online assessment, pretty standard two-sum style coding problem with a hash table angle. Nothing surprising but the edge cases in the test suite were worth paying attention to.
  • Given an integer array and a target value, find two distinct indices where the elements sum to the target. Return the indices in any order, or an empty array if no such pair exists. Aim for better than O(n^2) time.

“Classic two-sum, you'd think it's autopilot but the edge cases tripped me up a bit.”

View Post

Amazon·Data Scientist·Technical Phone Screen

Apr 2026
SQL-heavy technical screen for a DS role at Amazon, basically one big query problem about music listening overlap. The question had a few layers to it and I definitely underestimated how long it would take to write something clean.
  • You're building a friend recommendation feature for a music app. Given a listens table and an undirected friendships table, write a SQL query that finds all pairs of users who are not already friends but listened to more than 3 of the same distinct songs on the same calendar date. Output the smaller user id, larger user id, the date, and the count of overlapping songs.

“Took me a minute to even figure out where to start.”

View Post

Amazon·Product Manager·Onsite - Product Sense / Strategy

Apr 2026
Amazon PM interview with a single market sizing question about Bengaluru restaurants. Pretty straightforward round but these estimation questions always stress me out more than they should.
  • How many restaurants are there in Bengaluru, India?

“I started with population and tried to work down from households to eating-out frequency.”

View Post

Amazon·Software Engineer·Online Assessment (OA)

Apr 2026
Amazon SWE online assessment with a prefix sum coding problem. Nothing too wild but the O(n) constraint made me second-guess my approach the whole time.
  • Given an integer array and a target value, find the subarray whose sum is as close to the target as possible without exceeding it, and return that sum. Aim for O(n) time complexity using a prefix sum approach.

“I knew prefix sums going in but the 'maximize without exceeding' part tripped me up more than I expected.”

View Post

Amazon·Software Engineer·Onsite - System Design / Architecture

Apr 2026
Amazon system design round, one question the whole time: design a distributed message queue. No small talk, no warmup, just straight into it.
  • Design a distributed message queue system.

“Spent the first few minutes just trying to scope it out, which I think was the right call, but I probably over-indexed on the producer side and barely touched consumer group semantics until they nudged me.”

View Post

Amazon·Software Engineer·Onsite - Coding / Algorithms

Apr 2026
Amazon SWE coding round, three algorithmic problems back to back. The questions ranged from binary search variants to tree traversal to a classic DP problem with a harder follow-up. Pretty standard for this kind of loop but the third one had some teeth.
  • You have a sorted array where every element appears exactly twice except one. Find that single element in O(log n) time and O(1) space.
  • Given the root of an N-ary tree and a sequence of integers, check whether that sequence represents a valid path starting from the root. Values are not unique. Return true or false and analyze complexity.
  • Given two integer arrays, find the maximum length of a contiguous subarray that appears in both. Walk through multiple approaches and their trade-offs.

“Binary search on sorted arrays is something I practice, but the twist here is noticing that before the single element, pairs start at even indices, and after it they shift to odd.”

View Post

Amazon·Data Scientist·Technical Phone Screen

Apr 2026
SQL technical screen for a Data Scientist role at Amazon. One question, focused on window functions and salary ranking per department. Pretty standard stuff if you've done this kind of analysis before.
  • Given an employees table with salary and department columns, write a SQL query that returns the top 3 distinct salary amounts within each department.

“I went straight for DENSE_RANK which felt right since ties shouldn't eat up a rank slot.”

View Post

Amazon·Software Engineer·Technical Phone Screen

Apr 2026
Amazon SWE interview with a web crawler design question. More depth required than I expected for a coding round, since they pushed pretty hard on the design decisions behind the implementation.
  • Implement a web crawler for a single website. You're given a starting URL, a fetch function that returns HTML or throws an error, and an extractLinks function. Write a BFS crawler that stays within the same domain, normalizes URLs, retries failed fetches up to 3 times, skips permanently failed pages, and never revisits the same URL. Be ready to explain your queue and visited-set design, duplicate detection, and how retry logic fits into the crawl loop.

“I got the BFS part down pretty fast, queue with a visited set, standard stuff.”

View Post