# Data Stream As Disjoint Intervals: Study Guide
Data Stream As Disjoint Intervals shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Store disjoint closed intervals in a balanced tree keyed by start. On addNum, look up the left and right neighbors and merge when the new point touches or overlaps either side, then insert the merged interval.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (a heap or priority queue, Union-Find, interval scheduling, bitmask DP, a topological order, or a Trie) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(log n) per add.
## Common mistake
Restarting a full sort of all numbers on every getIntervals call without merging as you go (correct but slower than an online tree).
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI coding interview assistant.