# Hopcroft Karp Layered Matching: Study Guide
Hopcroft Karp Layered Matching shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
BFS builds distance layers from free left vertices, then several DFS augmentations run on that layering so each phase shortens remaining shortest paths.
## 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
O(E sqrt V).
## Common mistake
Allowing a DFS to use a residual edge that goes to a closer rather than next layer, which breaks the phase invariant.
## 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.