# Local Type Inference Pierce: Walkthrough

Local Type Inference Pierce shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Infer type arguments locally at each application by looking at the expected type and the argument types, without a global unification.

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

Used by Scala and earlier designs for GJ; some programs that HM accepts need extra annotations.

## Common mistake

Propagating an expected type through a lambda that has no parameter annotation and then guessing the wrong domain.

## 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 https://linkjob.ai.