# Aho Corasick Failure Links: Study Guide
Aho Corasick Failure Links shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Build a trie of all patterns and add failure links (KMP-style) so a text scan follows the automaton and reports every pattern that ends at the current position.
## 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(sum of pattern lengths + text length + number of matches) with an output-link chain.
## Common mistake
Forgetting output links and only checking the node itself, which misses a pattern that is a proper suffix of a longer matched pattern.
## 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 official website.