<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 helper(self, idx1, idx2):
        key = "{},{}".format(idx1, idx2)
        if key in self.memo:
            return self.memo[key]
        if idx1 == len(self.s):
            if idx2 == len(self.p):
                ans = True
            elif self.p[idx2] == "*":
                ans = self.helper(idx1, idx2+1)
            else:
                ans = False
        else:
            if idx2 == len(self.p):
                ans = False
            else:
                if self.s[idx1] == self.p[idx2] or self.p[idx2] == "?":
                    ans = self.helper(idx1+1, idx2+1)
                elif self.p[idx2] == "*":
                    ans = self.helper(idx1+1, idx2) or self.helper(idx1, idx2+1) or self.helper(idx1+1, idx2+1)
                else:
                    ans = False
        self.memo[key] = ans
        return ans

    def isMatch(self, s: str, p: str) -> bool:
        self.memo = dict()
        self.s = s
        self.p = p
        return self.helper(0,0)
62095