# Worklist Chaotic Iteration: Practice Notes

Worklist Chaotic Iteration shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Recompute a data-flow fact only for nodes whose predecessors changed, using a worklist instead of sweeping the whole CFG each round.

## 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

The number of node updates is often linear; worst-case still depends on the height of the lattice times n.

## Common mistake

Not adding successors back onto the worklist after a fact changes, which silently stops before a fixpoint.

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