<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, string: str, pattern: str) -> bool:
        dp={}
        opattern=pattern
        pattern=""
        for i in opattern:
            if pattern and pattern[-1]=='*' and i=='*':
                continue
            pattern+=i
        # print(pattern)

        def rec(i,j):
            # print(i,j)
            if (i,j) in dp:
                return dp[(i,j)]
            elif i==len(pattern) and j==len(string):
                return True
            elif i<len(pattern) and pattern[i]=='*':
                for k in range(j,len(string)+1):
                    # print('*',i+1,k)
                    if rec(i+1,k):
                        dp[(i,j)]=True
                        return dp[(i,j)]
                dp[(i,j)]=False
                return dp[(i,j)]
            elif i<len(pattern) and j==len(string):
                dp[(i,j)]=False
                return dp[(i,j)]
            elif i<len(pattern) and (pattern[i]=='?' or pattern[i]==string[j]):
                dp[(i,j)]=rec(i+1,j+1)
                return dp[(i,j)]
            dp[(i,j)]=False
            return dp[(i,j)]

        ans=rec(0,0)
        return ans
101778