# Colored Local Type Inference: Interview Notes

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

## Key idea

Track whether a type was fully known (inherited) or only partly known (synthesized) so optional arguments and overloading stay well-behaved.

## 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 refinement of Pierce/Turner local inference used in some production compilers.

## Common mistake

Treating a partly-known type as fully known and committing to a default that later arguments contradict.

## 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 Linkjob AI copilot.