Regular Expression Match


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

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.

Constraints:

1 <= length(A), length(B) <= 9e4

Examples :

Input 1:
    A = "aa"
    B = "a"

Output 1:
    0

Input 2:
    A = "aa"
    B = "aa"

Output 2:
    1

Input 3:
    A = "aaa"
    B = "aa"

Output 3:
    0
    
Input 4:
    A = "aa"
    B = "*"

Output 4:
    1

Input 5:
    A = "aa"
    B = "a*"

Output 5:
    1

Input 6:
    A = "ab"
    B = "?*"

Output 6:
    1

Input 7:
    A = "aab"
    B = "c*a*b"

Output 7:
    0
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 doubt? Checkout Sample Codes for more details.
Start solving Regular Expression Match on Interview Code Editor
Sign Up
to access hints and editorial solutions for Regular Expression Match
Asked In:

Discussion


Loading...
Click here to start solving coding interview questions