<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 match(self, s: str, p: str, memo: dict[tuple[int, int], int], x: int, y: int) -> bool:
        if x == len(s) and y == len(p):
            memo[(x, y)] = True
        elif x == len(s):
            memo[(x, y)] = (p[y] == '*') and self.match(s, p, memo, x, y + 1)
        elif y == len(p):
            memo[(x, y)] = False
        elif (x, y) not in memo:
            if p[y] == '*':
                memo[(x, y)] = (x + 1 == len(s) and y + 1 == len(p)) or self.match(s, p, memo, x, y + 1) or self.match(s, p, memo, x + 1, y)
            elif p[y] == '?':
                memo[(x, y)] = self.match(s, p, memo, x + 1, y + 1)
            else:
                memo[(x, y)] = (s[x] == p[y]) and self.match(s, p, memo, x + 1, y + 1)
        
        return memo[(x, y)]

    def isMatch(self, s: str, p: str) -> bool:
        simple_pattern = []
        for char in p:
            if char != '*' or not simple_pattern or simple_pattern[-1] != '*':
                simple_pattern.append(char)

        return self.match(s, ''.join(simple_pattern), dict(), 0, 0)

87348