# Aho-Corasick Multi-Pattern Search: Explained

Aho-Corasick Multi-Pattern Search shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Build a trie of patterns, add failure links by BFS, and walk the text once while following output links.

## 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(text + total pattern length + matches).

## Common mistake

Forgetting to merge output lists along failure links, missing nested patterns.

## 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 www.linkjob.ai.