<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:
        def solve(s,p,i,j):
            if i<0 and j<0:
                return True
            if i>=0 and j<0:
                return False
            if i<0 and j>=0:
                for k in range(0,j+1):
                    if p[k]!='*':
                        return False    
                return True
            
            # match
            if s[i]==p[j] or p[j]=='?':
                return solve(s,p,i-1,j-1)
            elif p[j]=='*':
                return (solve(s,p,i-1,j) or solve(s,p,i,j-1)) # j-1 means replace * with ' ' space 
            else:
                return False 

        def solveMemo(s,p,i,j,dp):
            ans=0
            if i<0 and j<0:
                return True
            if i>=0 and j<0:
                return False
            if i<0 and j>=0:
                for k in range(0,j+1):
                    if p[k]!='*':
                        return False    
                return True
            if dp[i][j]!=-1:
                return dp[i][j]    
            
            # match
            if s[i]==p[j] or p[j]=='?':
                ans=solveMemo(s,p,i-1,j-1,dp)
            elif p[j]=='*':
                ans=(solveMemo(s,p,i-1,j,dp) or solveMemo(s,p,i,j-1,dp)) # j-1 means replace * with ' ' space 
            else:
                ans=False 
            dp[i][j]=ans
            return dp[i][j]    

        def solveTab(s,p):
            ans=0
            if i<0 and j<0:
                return True
            if i>=0 and j<0:
                return False
            if i<0 and j>=0:
                for k in range(0,j+1):
                    if p[k]!='*':
                        return False    
                return True
            if dp[i][j]!=-1:
                return dp[i][j]    
            
            # match
            if s[i]==p[j] or p[j]=='?':
                ans=solveMemo(s,p,i-1,j-1,dp)
            elif p[j]=='*':
                ans=(solveMemo(s,p,i-1,j,dp) or solveMemo(s,p,i,j-1,dp)) # j-1 means replace * with ' ' space 
            else:
                ans=False 
            dp[i][j]=ans
            return dp[i][j]    

        def solveTab(s,p):
            ans=0
            dp=[[0]*(len(p)+1) for j in range(len(s)+1)]    
            dp[0][0]=True
            for j in range(1,len(p)+1):
                flag=True
                for k in range(1,j+1):
                    if p[k-1]!='*':
                        flag=False
                        break
                dp[0][j]=flag

            for i in range(1,len(s)+1):
                for j in range(1,len(p)+1):
                    if s[i-1]==p[j-1] or p[j-1]=='?':
                        ans=dp[i-1][j-1]
                    elif p[j-1]=='*':
                        ans=(dp[i-1][j] or dp[i][j-1]) # j-1 means replace * with ' ' space 
                    else:
                        ans=False 
                    dp[i][j]=ans
            return dp[len(s)][len(p)]             

    

        def isMatch(s,p):
            # return solve(s,p,len(s)-1,len(p)-1)

            dp=[[-1]*(len(p)+1) for j in range(len(s)+1)]
            # return solveMemo(s,p,len(s)-1,len(p)-1,dp)

            return solveTab(s,p)

        return isMatch(s,p)             



33235