# Fahndrich Das One Level Flow: Practice Notes
Fahndrich Das One Level Flow shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Allow one level of matching subtyping on pointer constraints so a pointer can flow into a structure without unifying the structure's fields.
## 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
Almost the speed of Steensgaard with much of Andersen's precision on typical C programs.
## Common mistake
Applying the one-level rule at every dereference depth, which silently becomes a full inclusion analysis.
## 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 assistant for technical interviews.