<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:
    def isMatch(self, s: str, p: str) -> bool:
        n1 = len(s)
        n2 = len(p)
        dp = [[None]* n2 for _ in range(n1)]
        def bt(i1,i2):
            if i1 < 0 and i2 < 0:
                return True
            # Only the pattern has characters left (not matching an empty string `s`)
            if i2 < 0:
                return False
            # Only the string has characters left but pattern is empty
            if i1 < 0:
                # Remaining pattern must only be '*'
                return p[i2] == "*" and bt(i1,i2-1)
            if dp[i1][i2] != None :return dp[i1][i2]
            if s[i1] == p[i2] or p [i2] == "?" :
                
                dp[i1][i2] =  bt(i1-1 , i2 -1)
                return dp[i1][i2]
            if p[i2]== "*":
                dp[i1][i2] =  bt(i1-1,i2) or bt(i1,i2-1)
                return dp[i1][i2]
            dp[i1][i2] = False                
            return False
        return bt(n1-1 , n2-1)
27824