<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>


from collections import defaultdict

class Solution:
    def isMatch(self, s: str, p: str) -> bool:


        dp = defaultdict(lambda: defaultdict(lambda: None))
        dp[-1][-1] = True
        for j in range(len(p)):
            if p[j] != "*":
                break
            for i in range(-1, len(s)):
                dp[i][j] = True

        def helper(i, j):
            if dp[i][j] is not None:
                return dp[i][j]
            elif not (0 <= i < len(s) and 0 <= j < len(p)):
                return False

            if s[i] == p[j] or p[j] == "?":
                dp[i][j] = helper(i - 1, j - 1)
            elif p[j] == "*":
                dp[i][j] = any(helper(k, j - 1) for k in range(i + 1))
            else:
                dp[i][j] = False

            return dp[i][j]

        return helper(len(s) - 1, len(p) - 1)

49469