# Brzozowski DFA Reverse Determinize: Practice Notes
Brzozowski DFA Reverse Determinize shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Reverse the automaton, determinize, reverse again and determinize once more; the last determinization yields a minimal DFA.
## 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
Worst-case exponential, but often small in practice for sparse NFAs.
## Common mistake
Skipping one of the two reverse-determinize passes, which leaves a correct but non-minimal DFA.
## 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 real-time interview help.