← Back to Directory

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

Jun 2026
Took the Amazon SDE online assessment recently, two questions total. Passed all the debugging test cases but only got 12 out of 15 on the DSA problem, so now I'm just sitting here wondering if that's enough to move forward.
  • Solve a DSA coding problem under timed OA conditions.
  • Debug a piece of existing code to identify and fix errors.

“Got 12/15 test cases which felt okay in the moment but now I keep second-guessing it.”

View Post

Amazon·Software Engineer·Online Assessment (OA)

Jun 2026
Amazon SWE coding round, one problem the whole session. It was a ring-graph shortest path thing dressed up as a drone delivery scenario. Felt manageable once I saw through the theme, but the edge cases kept me honest.
  • You have n hubs arranged in a ring, each connected to its neighbors by corridors with given lengths. Given a route as an ordered list of hub indices, find the total minimum distance a drone travels by always taking the shorter arc between consecutive stops.

“The ring structure is what makes it click.”

View Post

Amazon·Product Manager·Onsite - Behavioral / Leadership

Jun 2026
PM loop at Amazon, behavioral focus. Just one question shared but it's a classic they seem to love.
  • What is your most significant accomplishment, and why does it stand out to you?

“I had an answer ready but partway through I started second-guessing whether it was actually significant enough for Amazon's bar.”

View Post

Amazon·Software Engineer·Technical Phone Screen

Jun 2026
Interviewed at Amazon for what seemed like a voice/AI systems role, got asked about Alexa internals. Pretty technical, not a lot of fluff.
  • Walk me through how Alexa processes a voice command end to end.

“I knew the high-level stuff but stumbled when they pushed on the specifics between wake word detection and the actual NLU pipeline.”

View Post

Amazon·Software Engineer·Technical Phone Screen

Jun 2026
Amazon SWE coding round, one design question with a follow-up. Pretty focused session, no behavioral stuff from what I can tell.
  • Design a weighted random value generator class that supports adding values with associated weights and returns a random value with probability proportional to its weight.

“The core idea isn't hard once you think about prefix sums and binary search, but I spent too long second-guessing the data structure.”

View Post

Amazon·Software Engineer·Onsite - Multi Round

Jun 2026
Went through two rounds for an Amazon SDE-2 role and came out with mixed feelings. DSA went cleanly, LLD felt solid but got flagged as borderline, and now there's an HLD round coming up that's causing some anxiety. Posting mostly to get advice from people who've been through the Amazon system design loop recently.
  • Given an elevation map represented as an array of integers, calculate how much rainwater can be trapped between the bars.
  • Find the minimum eating speed for a character to finish all banana piles within a given number of hours.
  • Tell me about a time you went unusually deep to understand a problem or system.
  • Describe a time you simplified something that others thought had to be complex.
  • Design and implement an LRU Cache from scratch, including discussion of data structures, complexity, and a working coded solution.
  • Tell me about a time you put the customer first, even when it was inconvenient or costly for your team.
  • Walk me through how you handled a production outage or critical system failure.

“Solved it with the two-pointer approach, explained the logic as I went.”

View Post

Amazon·Software Engineer·Onsite - Coding / Algorithms

Jun 2026
Amazon SWE coding round with two back-to-back algorithm problems. Both were non-trivial and required actual thought, not just pattern matching to a leetcode number.
  • You have n blocks with non-negative integer heights. Starting from the ground (height 0), visit every block exactly once in any order. The calorie cost of each jump is the squared difference in heights. Maximize the total calories burned across all n jumps. Describe your algorithm and its time/space complexity.
  • Given two strings, you can remove all occurrences of at most one character from each string independently. Return true if the strings can be made into anagrams of each other after these removals. Describe your algorithm and its time/space complexity.

“This one took me a while to even see what was being optimized.”

View Post

Amazon·Software Engineer·Online Assessment (OA)

Jun 2026
Amazon OA for a SWE role, one coding problem about splitting strings. Pretty standard stuff but the edge cases tripped me up a bit.
  • Given a string where each character represents an item category, find the number of ways to split it into exactly two non-empty contiguous substrings such that the count of distinct characters appearing in both substrings exceeds a given integer k.

“My first instinct was brute force, just iterate over every split point and count shared characters each time.”

View Post

Amazon·Software Engineer·Onsite - Behavioral / Leadership

Jun 2026
Amazon program manager behavioral round, just one question but it took up most of the time. Classic leadership principle territory.
  • Tell me about a time you were mid-project and spotted a chance to do something bigger or better. Did you go for it, and what happened?

“This one tripped me up a bit because my first instinct was to talk about a win, but the real story I had was messier.”

View Post

Amazon·Software Engineer·Technical Phone Screen

Jun 2026
Amazon SWE interview with a linked list problem that sounds straightforward until you actually read the full requirements. The cycle detection part is fine, the 'now break it cleanly' part is where things get interesting.
  • Given the head of a singly linked list that may contain a cycle, detect whether a cycle exists and, if so, remove it by setting the offending node's next pointer to NULL. The offending node is the last node in the loop, the one whose next currently points back to the cycle entry. Return true if a cycle was found and broken, false otherwise. Do this in O(n) time and O(1) space.

“Floyd's algorithm gets you to cycle detection pretty fast, most people know that part.”

View Post