Skip to main content
Regular Expression Matching | AlgoCracked
AlgoCracked
ProblemsRegular Expression Matching
Hard28.0% acceptance
Dynamic ProgrammingStringRecursion

Regular Expression Matching

Given an input string s and a pattern p , implement matching that supports '.' and ' ' , where '.' matches any single character and ' ' matches zero or more of the element immediately preceding it. The match must cover the entire string s , not just a prefix. Return true if p matches all of s . Input format Input is [s, p] , e.g. [ aa , a* ] .

Loading workspace…