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

int dp[2001][2001];
string s ,t;

class Solution {
private:
    bool match(int i , int j ){

        if(j==t.size() && i==s.size()) return true;
        if(j==t.size()) return false;
        if(i==s.size() && t[j]!='*') return false;
        if(dp[i][j]!=-1) return dp[i][j];
        if(i==s.size() && t[j]=='*') return dp[i][j] = match(i ,j+1);
        

        

        if(t[j]!='?' && t[j]!='*' && s[i]!=t[j]) return dp[i][j] = false;
        if(s[i]==t[j]) return dp[i][j] = match(i+1,j+1);
        
        if(t[j]=='?') return dp[i][j] = match(i+1 , j+1);
        if(t[j]=='*'){
            bool ans = false;
            if(j+1 == t.size() ) return true;
            char next = t[j+1];

            for(int k = i ; k<=s.size();k++){
                ans |= match(k , j+1);                 
            }

            return dp[i][j] = ans;
        }

        return dp[i][j] = false;

    }


public:
    bool isMatch(string st, string p) {
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout.tie(NULL);
        memset(dp,-1,sizeof(dp));
        s = st;
        t = "";
        if(p.size()!=0) t =  string(1,p[0]);
        else t += "";

        for(int i = 1 ; i<p.size() ; i++){
            if(p[i-1] == p[i] && p[i]=='*'){
                continue;
            }else{
                t+= p[i];
            }
        }
     
        cout<<t<<endl;

        int n = s.size();
        int m = t.size();

        if(t=="*") return true;

        return match(0,0);

       
    }
};
25638