# SST Sparse Data Flow: Explained

SST Sparse Data Flow shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Use SSA (or SSI) def-use chains so a bit-vector analysis only visits the statements that mention the interesting names.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) 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

Often linear in the number of def-use edges rather than in every CFG node.

## Common mistake

Running the sparse analysis on names that were not put into SSA, which misses merges and becomes unsound.

## 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 www.linkjob.ai.