Regular Expression MatchingHard

string dynamic programming recursion

Does pattern p (supporting . = any char and x* = zero-or-more of x) match the entire string s? Watch the 2-D DP table fill in cell by cell, or trace the branching recursion.

Press play to watch the algorithm run.
Metrics
Legend
How it works
0 / 0