<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:
        if s==p:
            return True
        n=len(s)
        m=len(p)
        # if s=="":
        #     return len(p)==p.count("*")
        l1=len(s)
        l2=len(p)-p.count("*")
        end=m
        extra=l2-l1
        @cache
        def recur(i  ,j ,extra):
            if j==m and i!=n:
                return False
            if i==n:
                if j==m:
                    return True
                if p[j]=="*":
                    return recur(i ,j+1, extra)
                return False
            if s[i]==p[j]:
                return recur(i+1, j+1,extra)
            elif p[j]=="?":
                return recur(i+1, j+1,extra)
            elif p[j]=="*":
                if extra:
                    return recur(i+1, j+1 , extra-1) or recur(i+1 ,j , extra-1) or recur(i, j+1 ,extra)
                else:
                    return recur(i, j+1, extra)
        return recur(0,0,extra )
    
53076