164. Regular Expression Matching

Hard

Topics

Companies

Helpful tools to learn & understand

Visualize LogicActive Simulator

Watch key transitions, pointers, and variables update step-by-step.

Open

Check Solutions

Read clean, documented implementations across multiple patterns.

View Code

Thinkpad (Draw & Note)

Sketch diagrams on an infinite canvas and draft notes directly inline.

Draw

Example 1:

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

Output: false

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

Example 2:

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

Output: true

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

Example 3:

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

Output: true

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

Example 4:

Input: s = "aab", p = "c*a*b"

Output: true

Explanation: "c" can be repeated 0 times and "a" can be repeated 2 times resulting in "aab".

Example 5:

Input: s = "mississippi", p = "mis*is*p*."

Output: false

Explanation: The given pattern cannot fully match the entire input string.

Constraints:

•
•
•
•
•

Time Complexity

N/A

Space Complexity

N/A

164. Regular Expression Matching

Visualize LogicActive Simulator

Check Solutions

Thinkpad (Draw & Note)

Example 1:

Example 2:

Example 3:

Example 4:

Example 5:

Constraints:

Algorithm Overview

Topics

Companies