# Kildall Lattice Data Flow: Walkthrough

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

## Key idea

Specify a monotone function over a finite-height lattice and iterate until the least fixpoint, which is the classical framework for bit-vector analyses.

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

Termination follows from monotonicity and finite height; uniqueness of the least fixpoint follows from the Knaster-Tarski theorem.

## Common mistake

Using a non-monotone transfer function, which can oscillate and never reach 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 learn more.