← Back to Directory

Amazon interview notes, page 20 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 coding screen, pretty much just one problem the whole time. Nothing fancy but it'll trip you up if you're not thinking about edge cases.
  • Given an array of integers, find the pair of elements whose product is the largest.

“Seems easy until you remember negative numbers exist.”

View Post

Amazon·Software Engineer·Online Assessment (OA)

Apr 2026
Amazon SWE coding question involving merging two commit sequences while minimizing inversion-based conflicts. Feels like a DP problem dressed up in domain language.
  • Given two strings representing commit sequences from two branches, merge them into a single interleaved sequence that preserves the relative order of each branch. A conflict is defined as an inversion pair where a lower-priority character appears before a higher-priority one. Return the minimum number of conflicts across all valid merges.

“Took me a while to even parse what a 'conflict' meant here.”

View Post

Amazon·Data Scientist·Technical Phone Screen

Apr 2026
Amazon Data Scientist technical screen, pretty deep on algorithms. The whole thing was basically one extended coding problem with a bunch of follow-ups layered on top, and it went longer than I expected.
  • Implement a function that takes k sorted iterators (potentially unbounded) and an integer N, and returns the first N elements in ascending order across all iterators. Memory must stay O(k) and iterators may block.
  • What is the time complexity of your merge solution, and how does the stable tie-breaking by source index affect it?
  • How do you handle iterator exhaustion cleanly within this design?
  • How would you add deduplication to return only unique values, without increasing the asymptotic complexity?
  • Write unit tests covering k=1, empty streams, large N, and a pathological case where one iterator is much slower than the others.

“I went straight to a min-heap over k entries and felt pretty good about it.”

View Post

Amazon·Data Scientist·Onsite - System Design / Architecture

Apr 2026
Amazon system design round for a Data Scientist role, which turned out to be way more engineering-heavy than I expected. The whole thing was basically one giant multi-threaded crawler problem and they wanted actual pseudocode, not just hand-waving.
  • Design and write pseudocode for a multi-threaded web crawler that prioritizes breadth-first discovery while running continuous analysis tasks on fetched pages. Your design must respect robots.txt and per-host rate limits, deduplicate URLs with at-most-once processing, use bounded memory with disk spillover, implement back-pressure between crawling and analysis, and support graceful shutdown with exactly-once checkpointing on restart.
  • For the crawler design, define your core data structures for the frontier, the seen-set, and per-host token buckets. What are the big-O characteristics of each?
  • How would you prevent deadlocks and priority inversion in this crawler, and how would you detect and handle thread-safety bugs?
  • BFS ordering breaks down when crawling many hosts simultaneously. How does this happen and what would you do to approximate true BFS?
  • What metrics would you track to verify a 50%+ throughput improvement, and how would you design a controlled benchmark to prove it?

“This was the whole interview, basically.”

View Post

Amazon·Frontend Engineer·Technical Phone Screen

Apr 2026
Amazon frontend interview that was basically a live coding exercise turned design discussion. Built a flexbox grid and then had to defend scaling and accessibility decisions on the spot. More conversational than I expected but the follow-ups got deep fast.
  • You have a flexbox layout rendering 10 boxes in a responsive grid. How would you scale it to 100 boxes? Compare pagination vs. infinite scrolling, including pros, cons, when each fits, performance implications, and UX impact.
  • If you go with pagination, how do you make it accessible? Cover keyboard navigation, ARIA roles for the pagination component, focus management on page change, and live region announcements for screen readers.

“I went straight to infinite scroll because it felt modern and I thought that's what they wanted to hear.”

View Post

Amazon·Software Engineer·Onsite - Coding / Algorithms

Apr 2026
Amazon SWE coding round with a pretty gnarly string/virus problem. The constraints were large enough that a naive O(n^2) approach was never going to fly, so you had to think carefully about how substrings with at least one '*' accumulate over time.
  • You have a password string of length n and an attack order array (a permutation of 1..n). At each second i, the character at position attackOrder[i] gets replaced by '*'. The password becomes irrecoverable once the number of substrings containing at least one '*' reaches or exceeds m. Find the minimum time t after which the password is irrecoverable. If it's already irrecoverable before any attack, return 1. Constraints: n up to 8e5, m up to n*(n+1)/2.

“This one hurt a little.”

View Post

Amazon·Software Engineer·Onsite - Coding / Algorithms

Apr 2026
Amazon SWE coding round, one problem the whole time: longest mountain in an array. Felt manageable but the edge cases are sneakier than they look.
  • Given an integer array, find the length of the longest contiguous mountain subarray. A mountain must have at least 3 elements, a strict ascending portion, a peak, and a strict descending portion. Return 0 if none exists.

“The basic idea clicked pretty fast, scan for peaks and expand left and right.”

View Post

Amazon·Software Engineer·Onsite - Coding / Algorithms

Apr 2026
Amazon SWE coding round with a computational geometry problem that also doubled as an OOD design exercise. More involved than I expected, the math is manageable but the edge cases pile up fast and they clearly want class structure even on a pure algorithm question.
  • Given a list of line segments defined by their endpoints, find all pairwise intersection points and return them deduplicated.

“The parametric approach clicked for me pretty quickly, set up the 2x2 system, compute the cross product determinant, check t1 and t2 are both in [0,1].”

View Post

Amazon·Software Engineer·Onsite - Coding / Algorithms

Apr 2026
Amazon SWE coding round, one algorithmic question the whole time. The problem had a specific structural constraint that made the brute force obvious but useless, so you had to actually think.
  • Given an integer array, find the length of the longest contiguous subarray where the first and last elements are both strictly greater than every element in between. A brute-force O(n²) or worse solution is not acceptable.

“The brute force writes itself in like two minutes, which is exactly why it's a trap you can't fall into.”

View Post

Amazon·Software Engineer·Online Assessment (OA)

Apr 2026
Amazon SWE online assessment with a classic interval scheduling problem. Nothing too wild, just the sort of thing you either know cold or fumble depending on how much sorting you've practiced lately.
  • Given a list of meeting time intervals, determine whether a single person could attend all of them without any overlap.

“Sort by start time, then just check if any meeting starts before the previous one ends.”

View Post