Regular Expression Match

Problem Description

Implement wildcard pattern matching with support for '?' and '*' for strings A and B.

'?' : Matches any single character.
'*' : Matches any sequence of characters (including the empty sequence).

The matching should cover the entire input string (not partial).

Problem Constraints

1 <= |A|, |B| <= 9e4

Input Format

The first argument of input contains a string A.
The second argument of input contains a string B.

Output Format

Return 0 or 1:
=> 0 : If the patterns do not match.
=> 1 : If the patterns match.

Example Input

Input 1:

 A = "aa"
 B = "a"

Input 2:

 A = "aa"
 B = "aa"

Input 3:

 A = "aaa"
 B = "aa"

Input 4:

 A = "aa"
 B = "*"

Input 5:

 A = "aa"
 B = "a*"

Input 6:

 A = "ab"
 B = "?*"

Input 7:

 A = "aab"
 B = "c*a*b"

Example Output

Output 1:

Output 2:

Output 3:

Output 4:

Output 5:

Output 6:

Output 7:

NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.

Start solving Regular Expression Match on Interview Code Editor

Hints

Hint 1
Solution Approach
Complete Solution

Asked In:

Regular Expression Match

Discussion