# Glushkov Position Automaton: Walkthrough
Glushkov Position Automaton shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Build an NFA whose states are the symbol positions of a regex, with edges given by the first, last and follow sets, and no epsilon transitions.
## 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(n^2) states and edges for a regex of size n.
## Common mistake
Adding a follow edge from a last-position that is not nullable through the intervening operators.
## 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 try it free.