# Demand Driven Points To Heintze: Study Guide
Demand Driven Points To Heintze shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Answer a client query by walking only the constraints that can affect that pointer, instead of solving the whole program up front.
## 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
Time proportional to the slice of the constraint graph that the query reaches.
## Common mistake
Stopping the search at a load without continuing through the corresponding stores, which under-approximates the answer.
## 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 official website.