#1590Hard#1 in Snowflake's list· asked at 18 companies
Regular Expression Matching
Hosted on LeetCode
Solve it on LeetCode, track it here.
This problem's full statement lives on LeetCode. Open it in a new tab, then come back to mark it solved, add notes and keep your streak.
LeetCode Premium locked?
Most company-tagged LeetCode problems are behind Premium. If you have ChatGPT Plus or Claude Pro, ask it for the full statement, examples and constraints. The buttons below open a chat with the prompt already filled in.
What we know
Example 1
Input: s = "aa", p = "a" Output: false
Example 2
Input: s = "aa", p = "a*" Output: true
'*' lets 'a' repeat, so "a*" can match "aa".
Example 3
Input: s = "ab", p = ".*" Output: true
".*" means zero or more of any character.
Constraints
- •
1 <= s.length <= 20 - •
1 <= p.length <= 20 - •
scontains only lowercase letters;pcontains lowercase letters, '.' and '*'. - •
Every '*' is preceded by a valid character.