← Back to Directory

Amazon interview notes, page 44 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·Onsite - System Design / Architecture

May 2026
System design round at Amazon for a software engineering role. One question, pretty open-ended, and I definitely underestimated how much ground there was to cover.
  • How would you design Amazon Prime Video?

“I jumped straight into the video streaming pipeline and spent way too long on CDN and encoding before they nudged me toward user-facing features and scale requirements.”

View Post

Amazon·Technical Program Manager·Onsite - Behavioral / Leadership

May 2026
Behavioral screen for a TPM role at Amazon, pretty much one question deep into the leadership principles territory.
  • Tell me about a time you made a mistake and how you handled it.

“Classic Amazon behavioral question and I still fumbled the landing a bit.”

View Post

Amazon·Data Scientist·Technical Phone Screen

May 2026
Two algorithmic problems for an Amazon Data Scientist phone screen, both heavier on CS fundamentals than I expected for a DS role. The follow-up questions pushed into edge cases and streaming scenarios that I was not fully prepared for.
  • Given an array of integers and a target sum n, return the maximum number of elements you can pick such that their total does not exceed n. How would you handle zeros and negative numbers, and what is your time and space complexity?
  • If the same array is static but you need to answer up to 100,000 queries each with a different value of n, how would you preprocess the data to make queries efficient?
  • What if the array arrives as a stream you cannot fully store in memory? Describe a strategy that gives you the count with at most plus or minus one error, and justify why it works.
  • Given positive integers N and K, return the Kth smallest factor of N. If N has fewer than K factors, return -1. Optimize your solution for N up to 10^12 and explain how to avoid counting duplicate factors when N is a perfect square.

“Sorting and greedily picking from smallest works cleanly when everything is non-negative, but I stumbled when the interviewer brought up negatives.”

View Post

Amazon·Software Engineer·Onsite - Coding / Algorithms

May 2026
Amazon SWE coding round, got a filesystem traversal problem that looked deceptively simple at first glance. Took a while to get the regex right for the IP validation part.
  • Given a path to a directory, write a program that recursively scans all files under it, extracts all valid IPv4 addresses from the file contents, and prints each unique address once in lexicographic order. A valid IPv4 address has four dot-separated octets each between 0 and 255, with no leading zeros unless the octet is exactly zero.

“The recursion part was fine, that's just os.walk or equivalent.”

View Post

Amazon·Software Engineer·Technical Phone Screen

May 2026
Amazon SWE interview with an OOD problem centered on playing cards. Pretty focused session, just the one design problem but it had enough moving parts to keep you busy.
  • Design a standard deck of playing cards and implement two in-place operations on it: a shuffle function that randomizes an arbitrary deck, and a sort function that orders cards by suit (Clubs, Diamonds, Hearts, Spades) and then by rank (Ace through King).

“The shuffle part felt straightforward, Fisher-Yates came to mind pretty fast.”

View Post

Amazon·Software Engineer·Online Assessment (OA)

May 2026
Amazon SWE online assessment with a frequency-based array problem. Pretty standard algorithmic stuff but the one-pass constraint is what makes it interesting.
  • Given an array of integers, find the top k most frequent elements using only a single linear scan. Output them sorted by frequency descending, and by value ascending when frequencies tie.

“The single-pass constraint is what tripped me up.”

View Post

Amazon·Data Scientist·Technical Phone Screen

May 2026
Phone screen for a Data Scientist role at Amazon, pretty much a pure ML theory session. One meaty question about cross-validation that went deeper than I expected for a phone call.
  • Walk me through k-fold cross-validation. What are the trade-offs when picking the number of folds, and in what situations might cross-validation actually give you a misleading picture of model performance?

“I started with the mechanics fine, splitting data into k chunks, training on k-1, evaluating on the holdout, rotating through.”

View Post

Amazon·Software Engineer·Online Assessment (OA)

May 2026
Amazon SWE online assessment, one algorithmic problem about simulating a malware attack on a password string. Pretty involved for an OA, not your typical easy array question.
  • Given a password string, a permutation array defining the order in which characters get corrupted to '*', and an integer threshold m, find the minimum number of seconds before the password becomes 'unrecoverable' (i.e. the number of distinct substrings containing at least one '*' reaches or exceeds m). Return 1 if it's already unrecoverable from the start.

“This one took me a while to even parse.”

View Post

Amazon·Data Scientist·Technical Phone Screen

May 2026
Amazon Data Scientist interview with a SQL-heavy technical screen. Nothing too exotic but the questions covered a decent range, from database theory to writing actual queries under pressure.
  • What is a primary key and why does it matter in a relational database?
  • List the SQL join types you know and explain when you would use each one.
  • There are errors in this SQL query. Find and fix them: `select name MONTH(timestamp) FROM table WHEREMONTH(timestamp)>2010`
  • Given a Winner table and a Loser table, each with an ID and Name column, write a query that returns all names in a single column. Use both UNION and UNION ALL, then explain the difference.

“Pretty foundational stuff.”

View Post

Amazon·Data Scientist·Technical Phone Screen

May 2026
Amazon Data Scientist interview that dropped two coding problems back to back, both centered on integer arrays. Nothing too wild in terms of format but the edge case handling pressure was real.
  • Write a function that finds the mode of an integer list. If all values are unique, return None. Handle the case where multiple modes exist due to ties.
  • Given an integer array that contains values from 1 to n, output all prime numbers present in the array.

“I jumped straight to sorting and counting, which works but I could tell they wanted me to talk through a hash map approach first.”

View Post