<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 {
public:
    string st,pa = "";
    set<pair<int,int>> dp;
    bool solve(int idx1, int idx2){
        if(dp.contains({idx1,idx2}))
            return false;
        dp.emplace(idx1,idx2);
        while(idx1 < st.size()){
            if(pa[idx2] == '?');
            else if(pa[idx2] == '*'){
                if(idx2 == pa.size()-1)
                    return true;
                bool ans = false;
                for(int i = idx1; i<=st.size(); i++){
                    if(pa[idx2+1]==st[i] || pa[idx2+1]=='?'){
                        ans |= solve(i+1,idx2+2);
                    }
                }
                return ans;
            }
            else if(st[idx1]!=pa[idx2])
                return false;
            idx1++;
            idx2++;
        }
        return idx2>=pa.size() || (idx2 == pa.size()-1 && pa[idx2]=='*');
    }
    bool isMatch(string s, string p) {
        st = s;
        for(auto i:p){
            if(i!='*' || !pa.length() || pa[pa.length()-1]!='*')
                pa+=i;
        }
        return solve(0,0);
    }
};
19713