# Algorithm J Substitution Style: Practice Notes

Algorithm J Substitution Style shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Thread an explicit substitution through inference instead of Algorithm W's freshly instantiated schemes, which is easier to implement with a union-find unifier.

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

Same power as Algorithm W; the occurs check on unification keeps types regular.

## Common mistake

Skipping the occurs check so a type variable is unified with a type that contains it, producing an infinite type.

## 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 real-time interview help.