Regular Expression Matching

Hard

String

Dynamic Programming

Recursion

50 min

27.9%

Description

Given an input string s and a pattern p, implement regular expression matching with support for '.' and '*'.

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".

1 ≤ s.length ≤ 20
1 ≤ p.length ≤ 30
s contains only lowercase English letters.
p contains only lowercase English letters, '.', and '*'.
It is guaranteed for each appearance of the character '*', there will be a previous valid character to match.

Code Editor

Shyam Kunwar