hard Dynamic Programming 70 points

Regular Expression Matching

Given a string s and a pattern p, implement regular expression matching with support for '.' and '*' where '.' matches any single character and '*' matches zero or more of the preceding element.

Problem Description

Given a string s and a pattern p, implement regular expression matching with support for '.' and '*' where '.' matches any single character and '*' matches zero or more of the preceding element.

Examples

Example

Input: "aa", "a"

Output: false

Challenge Info

70 Points

Reward

hard

Difficulty

No limit

Time Limit

Submission Stats

Total Submissions 0
Accepted 0
Success Rate 0%