# k CFA Contour Sensitivity: Study Guide

k CFA Contour Sensitivity shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Index abstract contexts by the last k call sites so recursive functions do not collapse every invocation into one contour.

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

Exponential in k; 0-CFA is monovariant and polynomial, 1-CFA already expensive on large programs.

## Common mistake

Reusing the same contour for two call sites that should have been distinguished by the last k-history, which merges unrelated bindings.

## 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 interview copilot app.