<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:
        return self.isWildcardMatch(s, 0, p, 0, {})

    def isWildcardMatch(self, s: str, sIndex: int, p: str, pIndex: int, failures: dict[dict[int]]) -> bool:
        if failures.get(sIndex) != None:
            if failures[sIndex].get(pIndex) != None:
                return False
        isMatch = False
        if pIndex == len(p):
            isMatch = sIndex == len(s)
        elif p[pIndex] == '*':
            if sIndex != len(s):
                isMatch = self.isWildcardMatch(s, sIndex + 1, p, pIndex, failures)
                if not(isMatch):
                    isMatch = self.isWildcardMatch(s, sIndex + 1, p, pIndex + 1, failures)
            if not(isMatch):
                isMatch = self.isWildcardMatch(s, sIndex, p, pIndex + 1, failures)
        elif sIndex == len(s):
            isMatch = False
        elif p[pIndex] == '?' or s[sIndex] == p[pIndex]:
            isMatch = self.isWildcardMatch(s, sIndex + 1, p, pIndex + 1, failures)
        else:
#            if sIndex == len(s):
            isMatch = False
        if not(isMatch):
            if failures.get(sIndex) == None:
                failures[sIndex] = {}
            failures[sIndex][pIndex] = True
        return isMatch
44058