<p>Given an input string (<code>s</code>) and a pattern (<code>p</code>), implement wildcard pattern matching with support for <code>&#39;?&#39;</code> and <code>&#39;*&#39;</code> where:</p>

<ul>
	<li><code>&#39;?&#39;</code> Matches any single character.</li>
	<li><code>&#39;*&#39;</code> Matches any sequence of characters (including the empty sequence).</li>
</ul>

<p>The matching should cover the <strong>entire</strong> input string (not partial).</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;aa&quot;, p = &quot;a&quot;
<strong>Output:</strong> false
<strong>Explanation:</strong> &quot;a&quot; does not match the entire string &quot;aa&quot;.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;aa&quot;, p = &quot;*&quot;
<strong>Output:</strong> true
<strong>Explanation:</strong>&nbsp;&#39;*&#39; matches any sequence.
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;cb&quot;, p = &quot;?a&quot;
<strong>Output:</strong> false
<strong>Explanation:</strong>&nbsp;&#39;?&#39; matches &#39;c&#39;, but the second letter is &#39;a&#39;, which does not match &#39;b&#39;.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>0 &lt;= s.length, p.length &lt;= 2000</code></li>
	<li><code>s</code> contains only lowercase English letters.</li>
	<li><code>p</code> contains only lowercase English letters, <code>&#39;?&#39;</code> or <code>&#39;*&#39;</code>.</li>
</ul>

class Solution {
public:
bool helper(int i , int j , string text1, string text2 , vector<vector<int>> &dp){
    int n = text1.size();
    int m = text2.size();

    if(i == n && j == m){
        return true;
    }

    if(j == m && i<n){
        return false;
    }

    if(i == n && j<m){
        for(int k=j; k<m; k++){
            if(text2[k] != '*'){
                return false;
            }
        }

        return true;
    }

    if(dp[i][j] != -1){
        return dp[i][j];
    }

    
    if(text1[i] == text2[j] || text2[j] == '?'){
        return dp[i][j] = helper(i+1 , j+1 , text1 , text2 , dp);
    }
    else if(text2[j] == '*'){
        bool b = helper(i , j+1 , text1 , text2 , dp);

        bool c = helper(i+1 , j , text1 , text2 , dp);

        return dp[i][j] = b || c;
    }
    else{
        return dp[i][j] = false;
    }
}

int tabular(string text1, string text2){
    int n = text1.size();
    int m = text2.size();
    
    vector<vector<bool>> dp(n+1 , vector<bool>(m+1 , false));

    dp[n][m] = true;

    for(int k=m-1; k>=0; k--){
        if(text2[k] != '*'){
            break;
        }
        dp[n][k] = true;
    }

    for(int i = n-1; i>=0; i--){
        for(int j = m-1; j>=0; j--){
            if(text1[i] == text2[j] || text2[j] == '?'){
                dp[i][j] = dp[i+1][j+1];
            }
            else if(text2[j] == '*'){
                bool b = dp[i][j+1];

                bool c = dp[i+1][j];

                dp[i][j] = b || c;
            }
            else{
                dp[i][j] = false;
            }
        }
    }

    return dp[0][0];
}
    bool isMatch(string text1, string text2) {
        int n = text1.size();
        int m = text2.size();
    
        //vector<vector<int>> dp(n+1 , vector<int>(m+1 , -1));

        //return helper(0,0,text1 , text2 , dp);

        return tabular(text1,text2);
    }
};
17046