<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 rec(self, s, p, ans, memo):
        key = (tuple(s))
        if key in memo:
            return
        while len(s) > 0 and len(p) > 0 and (p[0] == s[0] or p[0] == '?'):
            s.pop(0)
            p.pop(0)
        
        if "".join(s) == "".join(p):
            ans[0] = True
            memo.add(key)
            return
        
        if len(p) > 0 and p[0] == '*':
            p.pop(0)
            for i in range(len(s) + 1):
                self.rec(s[i:].copy(), p.copy(), ans, memo)
        
        memo.add(key)
    def isMatch(self, s: str, p: str) -> bool:
        p = [x for x in p]
        i = 0
        while i+1 < len(p):
            if p[i] == p[i+1] and p[i] == '*':
                p.pop(i+1)
            else:
                i += 1
        s = [x for x in s]
        ans = [False]
        self.rec(s, p, ans, set())

        return ans[0]
20609