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

already_found = {}
class Solution:
    def addEl(self, s,p, val = True):
        curr = already_found.get(s, {})
        curr[p] = val
        already_found[s] = curr

    def findMatch(self,s,p):
        # print("Inputs ", s, p)
        dict_check = already_found.get(s,-1)
        
        if dict_check != -1:
            p_check = dict_check.get(p, -1)
            if  p_check != -1:
                return p_check
        if len(s) < len(p) - p.count('*'):
            self.addEl(s,p, False)
            return False
        elif len(s) == len(p) - p.count('*') and len(p) == p.count('*') + p.count('?'):
            self.addEl(s,p)
            print("2")
            return True
        if s == p:
            self.addEl(s,p)
            print("3")
            return True
        if len(p) == 1:
            if p != '?' and p != '*' and s == p:
                print("4")
                self.addEl(s,p)
                return True
            elif p == '*':
                self.addEl(s,p)
                print("5")
                return True
            elif p == '?' and len(s) == 1:
                self.addEl(s,p)
                print("6")
                return True
            self.addEl(s,p, False)
            return False
        if s != '' and p == '':
            self.addEl(s,p, False)
            return False
        if p[0] not in "*?":
            if p[0] == s[0]:
                res = self.findMatch(s[1:], p[1:])
                if res:
                    print("10")
                    self.addEl(s,p)
                return(res)
            else:
                self.addEl(s,p, False)
                return False
        elif p[0] == '?':
            res = self.findMatch(s[1:], p[1:])
            if res:
                print("11")
                self.addEl(s,p)
            else:
                self.addEl(s,p, False)
            return(res)
        else:
            if self.findMatch(s[1:], p):
                print("13")
                self.addEl(s,p)
                return True
            elif self.findMatch(s, p[1:]):
                self.addEl(s,p)
                print("14")
                return True
            self.addEl(s,p, False)
            return False

    def isMatch(self, s: str, p: str) -> bool:
        global already_found
        already_done = {}
        return self.findMatch(s,p)

        


        
        

        
        
54880