<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:
    int solve(string &s, string &p, int n, int m, vector<vector<int>>& dp){
        if(n == 0 && m == 0) return true;
        if(n == 0 && m > 0) return false;
        if(n > 0 && m == 0){
        bool flag = true;
        for(int i = 1; i <= n; i++){
            if(s[i-1] != '*'){
                flag = false;
            }
        }
        return flag;
        }
        if(dp[n][m] != -1) return dp[n][m];
        if(s[n-1] == p[m-1] || s[n-1] == '?'){
            return dp[n][m] = solve(s, p, n-1, m-1, dp);
        }
        if(s[n-1] == '*'){
            return dp[n][m] = solve(s, p, n, m-1, dp) | solve(s, p, n-1, m, dp); 
        }
       
            return dp[n][m] = false;
        
    }
    bool solver(string &s, string &p, int n, int m){
        vector<vector<bool>> dp(n+1, vector<bool>(m+1, false));
        
        dp[0][0] = true;
         bool flag = true;
         for(int i = 1; i <= n; i++){
            if(s[i-1] != '*'){
                flag = false;
            }
            dp[i][0] = flag;
        }
       for(int i =1; i<=n; i++){
        for(int j = 1; j<=m; j++){
           if(s[i-1] == p[j-1] || s[i-1] == '?'){
            dp[i][j] = dp[i-1][j-1];
        }
        else if(s[i-1] == '*'){
            dp[i][j] = dp[i][j-1] | dp[i-1][j]; 
        }
        else{
           dp[i][j] = false;
        }
        }
       }
       return dp[n][m];
    }
    bool isMatch(string s, string p) {
        int n = s.size();
        int m = p.size();
        
        return solver(p, s, m, n);
    }
};
14676