<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 dp[2001][2001];
    bool helper(string s, int ind1, string p, int ind2){
        if(ind1 < 0 && ind2 < 0) return true;
        if(ind2 < 0 && ind1 >=0) return false;

        if(ind1 < 0 && ind2 >=0){
            for(int k=0;k<=ind2;k++){
                if(p[k] != '*') return false;
            }
            return true;
        }

        if(dp[ind1][ind2] != -1) { return dp[ind1][ind2];}

        bool flag = false;
        if(p[ind2] == '?'){
            flag = flag || helper(s,ind1-1,p,ind2-1);
        }else if(p[ind2] == '*'){

            flag = flag || helper(s,ind1-1,p,ind2) || helper(s,ind1,p,ind2-1);
        }else if(p[ind2] == s[ind1]){
            flag = flag || helper(s,ind1-1,p,ind2-1);
        }

        return dp[ind1][ind2] = flag;
    }
    bool isMatch(string s, string p) {
        int n = s.size(), m = p.size();
        memset(dp,0,sizeof(dp));
        // return helper(s,n-1,p,m-1);

        dp[0][0] =  true;

        for(int j=1;j<=m;j++){
            bool flag = true;
            for(int k = 1;k<=j;k++){
                if(p[k-1]!='*'){
                    flag = false;
                    break;
                }
            }
            dp[0][j] = flag;
            if(!flag) break;
        }

        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                if(s[i-1] == p[j-1] || p[j-1] == '?'){
                    dp[i][j] = dp[i-1][j-1];
                }else if(p[j-1] == '*'){
                    dp[i][j] = (dp[i-1][j] || dp[i][j-1]);
                }else dp[i][j] = false;
            }
        }

        return dp[n][m];
    }
};
26823