← Back to Directory

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

Jul 2026
Amazon coding round, one meaty string parsing problem that looked deceptively simple at first glance. The Morse decoding angle made it way more interesting than a typical recursion question.
  • Given a Morse-encoded string with only word separators (no character separators), the encoding is ambiguous. Write a function that returns all possible decoded strings.

“The ambiguity part took me a second to fully internalize.”

View Post

Amazon·Software Engineer·Technical Phone Screen

Jul 2026
Amazon SWE coding round, just one algorithmic problem about a lottery system. Pretty straightforward once you see the pattern, but I fumbled around longer than I should have.
  • Given a list of lottery participants where each entry contains the amount spent and their probability of winning (linearly tied to spend), find the k participants with the highest winning probability.

“My first instinct was to sort the whole list and slice the top k, which works but I kept second-guessing myself on whether they wanted a heap-based solution for efficiency.”

View Post

Amazon·Product Manager·Onsite - Behavioral / Leadership

Jul 2026
Did a PM loop at Amazon and this customer obsession question came up pretty early. Pretty standard LP territory but I still fumbled parts of it.
  • Tell me about a project where you made the customer your top priority.

“I had a story ready but I spent too long on the setup and barely got to the actual impact.”

View Post

Amazon·Software Engineer·Onsite - Coding / Algorithms

Jul 2026
Amazon SWE coding round, just one algorithmic problem about water flow on a 2D terrain grid. Pretty straightforward BFS/DFS territory but the edge cases took me longer than I'd like to admit.
  • Given a 2D terrain map of heights and a starting point where water drops, find all the grid cells that get wet as water flows from higher to lower neighboring cells.

“My first instinct was BFS and I think that was right, but I fumbled the neighbor comparison for a bit.”

View Post

Amazon·Product Manager·Onsite - Product Sense / Strategy

Jul 2026
Amazon PM interview with a classic product sense question about infrastructure changes and their downstream effects. Pretty open-ended, which I was not fully prepared for.
  • If internet speed were 100 times faster than today, what would change?

“I went straight to consumer stuff like faster streaming and downloads, which in hindsight was the boring answer.”

View Post

Amazon·Software Engineer·Onsite - Behavioral / Leadership

Jul 2026
Interviewed for an EM role at Amazon and got hit with a question about earning trust with a team you inherited rather than built. Short post but it's one that stuck with me.
  • How do you establish credibility with direct reports on a team you didn't hire or build yourself?

“Went with the angle of listening before changing anything, which felt right but I think I undersold the actual mechanics.”

View Post

Amazon·Data Scientist·Technical Phone Screen

Jul 2026
Amazon data scientist interview with a meaty A/B testing design question. The whole session basically lived or died on how deep you could go on experimentation fundamentals, not just the surface stuff.
  • An e-commerce company is considering offering a 10% discount to boost conversions. Walk through how you would design and analyze an A/B test for this: hypotheses, metrics, sample size, experiment setup, and how you'd interpret the results.

“This looked like a clean textbook question until I actually started answering it.”

View Post

Amazon·Software Engineer·Onsite - Coding / Algorithms

Jul 2026
Amazon SWE coding round, one algorithmic problem for the whole session. The problem looked deceptively simple at first glance but there's a subtle constraint on guard movement that makes it easy to miss edge cases.
  • You have n cities in a row, each with a population value. Some cities start with a security guard. Each guard can move at most one step to the left, but only if the destination city is unoccupied. You can perform moves in any order. After all moves are done, the protected population is the sum of populations of cities that have a guard. Find the maximum protected population you can achieve.

“Spent way too long convincing myself this was a greedy problem before actually verifying it.”

View Post

Amazon·Data Scientist·Technical Phone Screen

Jul 2026
Amazon DS technical screen, one question but it was a beast. They packed omitted variable bias, heteroscedasticity, WLS vs robust SEs, and a specification test all into a single problem about building energy models. Left feeling like I'd passed a qual exam.
  • You have a true data-generating process for building energy use with temperature, occupancy, and heteroscedastic errors, but you fit OLS on temperature alone. Derive the expected bias on the temperature coefficient, state its sign when hotter days tend to be more occupied, explain what WLS and robust standard errors each do (and don't do) for you, then name a test for remaining heteroscedasticity and describe a diagnostic you'd put in a production training report.

“This question ate me alive for the first two minutes.”

View Post

Amazon·Software Engineer·Technical Phone Screen

Jul 2026
Amazon SWE interview with a scheduling/optimization problem that looked deceptively simple at first glance. The greedy logic took a while to click and I'm not totally sure I nailed the complexity analysis on the spot.
  • You have N delivery centers and a list of orders, each with a destination city. Each center handles at most one order per day, but if the order's city doesn't match the center's ID it costs 2 days of capacity instead of 1. Orders can't be split across centers. Write an efficient function to find the minimum number of days to complete all orders, and analyze its time and space complexity.

“Took me a minute to even understand what 'two days of capacity' meant.”

View Post