<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:
    dp = {}
    def isMatch(self, s: str, p: str) -> bool:
        if p not in self.dp:
            self.dp[p] = {}
        if p in self.dp:
            if s in self.dp[p]:
                return self.dp[p][s]
            
        #print('p =' , p)
        #print('s =' , s)
        sIndex = 0 
        pIndex = 0 
        while sIndex < len(s) and pIndex<len(p):
            if p[pIndex] == s[sIndex] or p[pIndex] == '?':
                pIndex+=1
                sIndex+=1
            elif p[pIndex] == '*':
                if pIndex == len(p)-1:
                    self.dp[p][s] = True
                    return True
                else:
                    while p[pIndex] == '*':
                        pIndex+=1
                        if pIndex == len(p):
                            self.dp[p][s] = True
                            return True
                    pIndex -=1
                    while sIndex < len(s):
                        if self.isMatch(s[sIndex:],p[pIndex+1:]):
                            self.dp[p][s] = True
                            return True
                        sIndex+=1
                    self.dp[p][s] = False
                    return False
            else:
                self.dp[p][s] = False
                return False
        while pIndex<len(p):
            if p[pIndex] !='*':
                self.dp[p][s] = False
                return False
            pIndex+=1
        self.dp[p][s] = sIndex == (len(s)) and pIndex == len(p)
        return self.dp[p][s]
36843