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

from collections import deque
class Solution:
    def isMatch(self, s: str, p: str) -> bool:
        temp = []
        for c in p:
            if c == '*' and len(temp) > 0 and temp[-1] == '*':
                continue
            temp.append(c)
        p = ''.join(temp)
        # int(p)
        queue = deque()
        queue.append((0, 0))
        len_s = len(s)
        len_p = len(p)
        seen = set()
        while len(queue):
            node  = queue.pop()
            if node in seen:
                continue
            seen.add(node)
            s_index, p_index = node
           # print(s_index, p_index)
            s_char = s[s_index] if s_index < len_s else ''
            p_char = p[p_index] if p_index < len_p else ''
            if s_char == '' and p_char == '':
                return True
            if p_char == '?' and s_char != '':
                queue.append((s_index + 1, p_index + 1))
            if s_char == p_char:
                queue.append((s_index + 1, p_index + 1))
            if p_char == '*':
                queue.append((s_index, p_index + 1))
                if s_index + 1 <= len(s):
                    queue.append((s_index+1, p_index))
            seen.add((s_index, p_index))

            
            
            
        return False
71114