amazon logo
Amazon· SDE 1

Amazon Interview Experience | SDE 1

Result
Ongoing
Location
Bangalore/Hyderabad
Posted
30 Oct 2025
453 reads

Summary

Interviewed for SDE 1 position at Amazon. The process included an OA with 2 DSA questions, followed by a DSA round with two coding problems, and a system design round with a design question. The candidate is currently awaiting the outcome.

How it went

Company: Amazon
Role: SDE 1
Location: Bangalore/Hyderabad

Round 1: OA
Coding Assessment: 2 DSA questions
Workstyles Assessment: Amazon’s Leadership Principles

Round 2: DSA
Q1. Two sum extended to Subset sum
Q2. Min Stack

Round 3:
Q1. Within a binary tree, a node x is considered good if the path from the root of the tree to the node contains no nodes with a value greater than the value of node Given the root of a binary tree root, return the number of good nodes within the tree.
Q2. At Amazon, we often work with massive real-time data streams. To extract meaningful insights from such data, it’s essential to design systems that can efficiently summarize large volumes of incoming information.
You are asked to design a system that processes a stream of non-negative integers and maintains a real-time summary of all numbers observed so far.
The summary should be presented as a list of disjoint intervals, where each interval represents a contiguous sequence of observed numbers.

Example
Input: ["SummaryRanges", "addNum", "getIntervals", "addNum", "getIntervals",
"addNum", "getIntervals", "addNum", "getIntervals", "addNum", "getIntervals"]
[[], [1], [], [3], [], [7], [], [2], [], [6], []]
Output: [null, null, [[1,1]], null, [[1,1],[3,3]], null, [[1,1],[3,3],[7,7]],
null, [[1,3],[7,7]], null, [[1,3],[6,7]]]

Questions asked (4)

  1. 01

    Subset Sum Problem

    Data Structures & Algorithms

    Two sum extended to Subset sum

  2. 02

    Min Stack Implementation

    Data Structures & Algorithms

    Min Stack

  3. 03

    Good Nodes in Binary Tree

    Data Structures & Algorithms

    Within a binary tree, a node x is considered good if the path from the root of the tree to the node contains no nodes with a value greater than the value of node. Given the root of a binary tree root, return the number of good nodes within the tree.

  4. 04

    Design a Real-time Data Summary System

    System Design

    At Amazon, we often work with massive real-time data streams. To extract meaningful insights from such data, it’s essential to design systems that can efficiently summarize large volumes of incoming information.
    You are asked to design a system that processes a stream of non-negative integers and maintains a real-time summary of all numbers observed so far.
    The summary should be presented as a list of disjoint intervals, where each interval represents a contiguous sequence of observed numbers.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Amazon recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!