# Supercombinator Full Laziness: Walkthrough
Supercombinator Full Laziness shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Lift maximal free subexpressions as extra supercombinator parameters so a shared computation is not repeated across partial applications.
## 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 free-variable analysis plus lambda lifting of those maximal free expressions.
## Common mistake
Lifting an expression that still mentions a lambda-bound variable, which is not actually free and breaks the binding.
## 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 the Linkjob AI app.