<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:
        memo = {}
        
        def rec(i1, i2):
            # If both indices are out of bounds, it's a match
            if i1 < 0 and i2 < 0:
                return True
            
            # If the pattern index is out of bounds but the string index is not,
            # return False because we can't match an empty pattern with a non-empty string
            if i2 < 0:
                return False
            
            # If the string index is out of bounds, ensure that the remaining pattern can only match empty strings
            if i1 < 0:
                return all(x == '*' for x in p[:i2 + 1])
            
            if (i1, i2) in memo:
                return memo[(i1, i2)]
            
            if p[i2] == s[i1] or p[i2] == "?":
                memo[(i1, i2)] = rec(i1 - 1, i2 - 1)
            elif p[i2] == "*":
                memo[(i1, i2)] = rec(i1 - 1, i2) or rec(i1, i2 - 1)
            else:
                memo[(i1, i2)] = False
                
            return memo[(i1, i2)]
        
        return rec(len(s) - 1, len(p) - 1)

139656