# Johnsson Lambda Lifting: Walkthrough
Johnsson Lambda Lifting shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Turn nested functions into supercombinators by adding free variables as extra parameters and floating the definitions to top level.
## 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
A linear walk plus a dependency sort of the binding groups.
## Common mistake
Forgetting a free variable in the lifted parameter list, which leaves an unbound reference in the supercombinator.
## 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.