# Constraint Based HM Inference: Study Guide

Constraint Based HM Inference shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Generate equality and instantiation constraints in one pass and solve them afterwards, instead of interleaving unification with the AST walk.

## 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; easier to extend with qualified types or type classes.

## Common mistake

Solving an instantiation constraint as if it were equality, which freezes a polymorphic scheme too early.

## 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 interview copilot app.