<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 fun(int index1, int index2, string& s, string& p, vector<vector<int>> &dp) {
        if (index1 < 0 && index2 < 0)
            return 1;
        if(index1<0 &&index2>=0)
        {
            for(int j=index2;j>=0;j--)
            {
                if(p[j]!='*')
                return 0;
            }
            return 1;
        }
        if (index1 >= 0 && (index2 < 0))
            return 0;
        if(dp[index1][index2]!=-1)
        return dp[index1][index2];
        if (p[index2] == s[index1] || (p[index2] == '?'))
        return dp[index1][index2]=fun(index1 - 1, index2 - 1, s, p,dp);

        if (p[index2] == '*') {
            return dp[index1][index2]=fun(index1 - 1, index2 - 1, s, p,dp)
            | fun(index1 - 1, index2, s, p,dp) | fun(index1, index2 - 1, s, p,dp);
        }
        return dp[index1][index2]=0;
    }
    bool isMatch(string s, string p) { 
        vector<vector<int>> dp(s.size()+1,vector<int>(p.size()+1,-1));
        return fun(s.size()-1,p.size()-1,s, p,dp); 
    }
};
31859