# Regular Expression Matching: Walkthrough
Regular Expression Matching shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
DP on (i, j): a '*' consumes zero copies of the previous token or one more character that matches it; memoize the two-way branch.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (string DP, sliding window, trie, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(nm).
## Common mistake
Treating '*' as a standalone token instead of a modifier of the previous atom.
## 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 Linkjob AI.