<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 dp(i: int, j: int) -> bool:
            if (i, j) in memo:
                return memo[i, j]

            # print(i, j)

            # ab*c should match abc, abzysc, abbbbc
            # abc -> matches 0 characters, ignore the pattern
            # abzysc -> repeat the pattern by the s[i+1]
               
            if p[j:] == s[i:] or p[j:] == '*':
                memo[i, j] = True
            elif j == n or i == m:
                memo[i, j] = False
            elif p[j] in (s[i], '?'):
                # print('herer')
                memo[i, j] = dp(i+1, j+1)
                # print(memo[i, j])
            elif p[j] == '*':
                # print('there')
                memo[i, j] =  dp(i, j+1) or dp(i+1, j)
                # print('...', memo[i,j])
            else:
                memo[i, j] = False

            return memo[i, j]

        new_p = []
        for char in p:
            if not new_p or char != '*':
                new_p.append(char)
            elif new_p[-1] != '*':
                new_p.append(char)
        p = ''.join(new_p)
        m = len(s)
        n = len(p)
        return dp(0, 0)
    
107189