# Antimirov Partial Derivatives: Interview Notes

Antimirov Partial Derivatives shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Represent the partial derivative of a regex as a set of regexes rather than a single derivative, which keeps the NFA linear in the regex size.

## 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

At most n partial derivatives, so the NFA has O(n) states.

## Common mistake

Using Brzozowski's single derivative instead, which can explode to exponentially many distinct regexes.

## 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 undetectable AI interview copilot.