<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:
        queue = deque([(0,0)]) # stores tuples of s_ptr, p_ptr pairs
        seen = set()
        seen.add((0,0))
        while queue: 
            s_ptr, p_ptr = queue.popleft()

            if s_ptr == len(s) and p_ptr == len(p):
                return True
            if p_ptr == len(p): 
                continue
            if s_ptr == len(s): 
                allSpecial = True
                while p_ptr < len(p): 
                    if p[p_ptr] != '*':
                        allSpecial = False
                    p_ptr += 1
                if allSpecial: 
                    return True
                else: 
                    continue
            
            sc = s[s_ptr]
            pc = p[p_ptr]

            if pc == '?':
                if (s_ptr+1, p_ptr+1) not in seen:
                    queue.append((s_ptr+1, p_ptr+1))
                    seen.add((s_ptr+1, p_ptr+1))
                continue
            if pc == '*': 
                if (s_ptr+1, p_ptr+1) not in seen:
                    queue.append((s_ptr+1, p_ptr+1))
                    seen.add((s_ptr+1, p_ptr+1))
                if (s_ptr+1, p_ptr) not in seen:
                    queue.append((s_ptr+1, p_ptr))
                    seen.add((s_ptr+1, p_ptr))
                if (s_ptr, p_ptr+1) not in seen:
                    queue.append((s_ptr, p_ptr+1))
                    seen.add((s_ptr, p_ptr+1))
            
            if pc == sc: 
                if (s_ptr+1, p_ptr+1) not in seen:
                    queue.append((s_ptr+1, p_ptr+1))
                    seen.add((s_ptr+1, p_ptr+1))

        return False

            

72918