<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 len(s) > 0 and len(p) == 0:
            return False


        # dp = [  [False]*len(p)  for _ in range(len(s))]

        # for i in range(len(s)):
        #     for j in range(len(p)):
        #         if i>= len(s) and j >= len(p):
        #             return True 
        #         if i >= len(s) :
        #             for x in range(j , len(p)):
        #                 if p[x]!='*':
        #                     return False
        #             return True

        #         if j >= len(p):
                
        #             return p[-1] == '*'
            

        # for i in range(len(s)-1,-1,-1):
        #     for j in range(len(p)-1,-1):
        #         star = not_star = False

        #         if s[i] == p[j] or p[j] =='?':
        #             not_star = dp[i+1][j+1]

        #         if p[j] == '*':
        #             for x in range(i,len(s)):
        #                 star = star or dp[x][j+1]
        #         dp[i][j] = star or not_star




        # return dp[0][0]










        dp = {}
        def func(i,j):
            if i>= len(s) and j >= len(p):
                return True

            if i >= len(s) :
                for x in range(j , len(p)):
                    if p[x]!='*':
                        return False
                return True

            if j >= len(p):
                
                return p[-1] == '*'
            
            if (i,j) not in dp:
                star = not_star = False

                if s[i] == p[j] or p[j] =='?':
                    not_star = func(i+1,j+1)

                if p[j] == '*':
                    # for x in range(i,len(s)):
                    #     star = star or func(x,j+1)
                    star = func(i, j + 1) or func(i + 1, j)
                dp[(i,j)] = star or not_star

            return dp[(i,j)]

        return func(0,0)
121619