Hard

Quiz

#10 Regular Expression Matching

APPROACH

Implement pattern matching for string s and pattern p where '.' matches any single character and '*' matches zero or more of the preceding element. The entire input string must be matched, not just a prefix.

Example 1:

Input: s = "aa", p = "a"

Output: false

Explanation: "a" does not match the entire string "aa".

Example 2:

Input: s = "aa", p = "a*"

Output: true

Explanation: '*' means zero or more of the preceding element, 'a'. Therefore, by repeating 'a' once, it becomes "aa".

Example 3:

Input: s = "ab", p = ".*"

Output: true

Explanation: ".*" means "zero or more (*) of any character (.)".

1 of 4

1:00

What is the optimal approach for this problem?