# Bidirectional Type Checking: Walkthrough

Bidirectional Type Checking shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Split typing into synthesize and check modes so annotations flow inward and inferred types flow outward, reducing the annotation burden.

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

Linear in the size of the term when unification stays well-behaved.

## Common mistake

Switching to synthesize in a check position without first applying the expected type, which loses principality.

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