← Back to Directory

Amazon interview notes, page 42 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 online assessment with a tree problem that looks straightforward until you actually sit down to code it. Nothing too wild but the edge cases are sneaky.
  • Given a binary tree and two node values x and y, determine whether the two nodes are siblings (same parent), cousins (same depth but different parents), or neither.

“My first instinct was BFS and track depth plus parent for each node, which works fine.”

View Post

Amazon·Software Engineer·Onsite - Behavioral / Leadership

May 2026
Behavioral loop at Amazon for a software engineer role, three questions total with follow-ups off the resume. Nothing too surprising but the AI tools question threw me a bit since I wasn't expecting it to be a real topic they cared about.
  • Walk me through the most complex technical problem you've solved from start to finish.
  • How do you use generative AI tools like Copilot, ChatGPT, or Cursor in your day-to-day engineering work?
  • Tell me more about a specific project listed on your resume.

“This is the kind of question where you think you have a good story until you're halfway through telling it and realize you're describing the problem more than what you actually did.”

View Post

Amazon·Machine Learning Engineer·Technical Phone Screen

May 2026
Amazon ML engineer phone screen, one algorithmic problem the whole time. The question was about cycle detection in a directed graph and they wanted near-linear complexity. Pretty standard graph theory but the constraints made it interesting.
  • You have a directed acyclic graph with n nodes and a list of existing edges. Given a candidate new directed edge, write a function that returns true if adding it keeps the graph acyclic, or false if it introduces a cycle. Your solution should run in close to linear time given up to 100k nodes and edges.

“My first instinct was just 'run a full topological sort after adding the edge' which technically works but I second-guessed myself on whether that was efficient enough.”

View Post

Amazon·Software Engineer·Onsite - Coding / Algorithms

May 2026
Amazon SWE coding round with two algorithm problems back to back. Both were graph/set problems dressed up in product clothing, which felt very Amazon. Nothing behavioral, just code and complexity analysis.
  • Given a list of users (each with friends and purchases), write a function that returns product names purchased by at least one friend of a target user but never purchased by the target user themselves. Walk through your algorithm and give time/space complexity.
  • You have a table of navigation events with source and destination URLs. Build an in-memory graph from these records and implement a function to determine if url2 is reachable from url1. Include complexity analysis in terms of distinct URLs and edges.

“Seemed straightforward at first.”

View Post

Amazon·Software Engineer·Technical Phone Screen

May 2026
Amazon coding screen, just one problem about subarrays. Pretty short session, not much else to say about it.
  • Given an array of integers, determine whether any contiguous subarray exists whose elements sum to zero.

“Classic prefix sum problem but I fumbled the edge cases at first.”

View Post

Amazon·Software Engineer·Technical Phone Screen

May 2026
Amazon Applied Scientist interview that went deep on computer vision work. The whole thing was basically a technical interrogation of your past projects, so if you're not ready to defend every architectural choice you made, it will show.
  • Walk me through a computer vision project you've worked on in detail: what model architecture did you use, how did you handle dataset collection and labeling, and how did you set up training and evaluation?
  • What were the key results of your computer vision project, and what failure modes did you observe during development or deployment?
  • Looking back at your computer vision work, what would you change about the technical decisions you made?

“This is the kind of question that sounds easy until you realize they want the full picture, not a highlight reel.”

View Post

Amazon·Software Engineer·Technical Phone Screen

May 2026
Amazon BI Engineer interview that came down to a classic linked list merge problem. Nothing shocking, but they made it clear you should be ready to go beyond the basic version.
  • Given the heads of two sorted linked lists, merge them into a single sorted linked list by splicing the original nodes together and return the head of the result.

“Pretty standard if you've seen it before.”

View Post

Amazon·Software Engineer·Online Assessment (OA)

May 2026
Amazon OA for a SWE role. One algorithmic problem about making array elements unique with minimum cost. Pretty standard greedy/sorting type of problem but the wording was dressed up in retail product flavor.
  • Given an array of product dimensions and an array of per-unit adjustment costs, find the minimum total cost to make all dimensions unique by incrementing values one unit at a time.

“The retail framing threw me off at first, took a minute to realize it's basically just 'make all array elements distinct with minimum increment cost.' Once I stripped the flavor text it clicked.”

View Post

Amazon·Software Engineer·Online Assessment (OA)

May 2026
Amazon SWE coding round with a sliding window or sorting-based problem about finding the longest subsequence where adjacent sorted elements differ by less than k. Pretty clean problem but the constraints make you think twice about brute force.
  • Given an integer array and a positive integer k, find the maximum length of a subsequence of distinct elements such that when sorted, every adjacent pair differs by less than k.

“My first instinct was to sort the whole array and then do a sliding window pass, which works fine.”

View Post

Amazon·Software Engineer·Technical Phone Screen

May 2026
Two fairly meaty algorithmic problems for an Amazon SWE round. The first was more about data structure design than raw coding, and the second had a geometry twist that slowed me down more than I'd like to admit.
  • You have an array of servers where each value represents how many requests that server handles. Each day you get a batch replacement: swap every occurrence of one value with another. After each day's replacements, return the total sum. How do you design an efficient data structure to handle this, and what are the edge cases?
  • Given a binary grid where 1s are delivery centers and 0s are empty cells, the distance metric is Chebyshev distance. The city's inconvenience is the max distance from any empty cell to its nearest center. You can flip at most one 0 to a 1. Return the minimum possible inconvenience after that optional addition.

“My first instinct was to just iterate the whole array every day and that's obviously too slow.”

View Post