@AbhishekAhlawat1102
This is a DP problem try to break the problem into sub problem and see if you are able to come up with a recurring expression
Each occurrence of β?β character in wildcard pattern can be replaced with any other character and each occurrence of β*β with a sequence of characters such that the wildcard pattern becomes identical to the input string after replacement.
Letβs consider any character in the pattern.
Case 1: The character is β*β Here two cases arise
We can ignore β β character and move to next character in the Pattern. β β character matches with one or more characters in Text. Here we will move to next character in the string. Case 2: The character is β?β We can ignore current character in Text and move to next character in the Pattern and Text.
Case 3: The character is not a wildcard character If current character in Text matches with current character in Pattern, we move to next character in the Pattern and Text. If they do not match, wildcard pattern and Text do not matchβ¦