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

import functools
class Solution:
    def isMatch(self, s: str, p: str) -> bool:
        string1 = s
        string2 = ''
        prev = ''
        for c in p:
            if prev == "*" and c == "*": pass
            else:
                string2 += c
                prev = c

        if s == "" and set(p) == {"*"}: return True
        
        @functools.cache
        def recur(index1, index2):
            if index1 >= len(string1) and index2 >= len(string2):
                return True
            elif index2 == len(string2) - 1 and string2[index2] == "*":
                return True
            elif index1 >= len(string1) or index2 >= len(string2):
                return False
            else:
                if string1[index1] == string2[index2] or string2[index2] == "?":
                    return recur(index1+1, index2+1)
                elif string2[index2] == "*":
                    a1 = recur(index1+1, index2)
                    a2 = False
                    if string1[index1] == string2[index2+1]:
                        a2 = recur(index1, index2+1)
                    a3 = recur(index1, index2+1)
                    return a1 or a2 or a3
        return(recur(0,0))
127030