<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 {
    string removeConsecutiveStars(string& p)
    {
        if(p == "")
            return p;

        string res;
        res += p[0];
        for(int i=1; i<p.size(); i++)
        {
            if(p[i] == '*' && p[i] == p[i-1])
                continue;
            
            res += p[i];
        }

        return res;
    }

    bool solve(vector<vector<int>>& dp, string& s, string& p, int i, int j)
    {
        if(i == s.size() && j == p.size()) 
            return true;
        
        if(j == p.size())
            return false;
    
        if(i == s.size())
            return (j == p.size()-1 && p[j] == '*');

        if(dp[i][j] != -1)
            return dp[i][j];

        if(p[j] == '*')
        {
            if(solve(dp, s, p, i, j+1) || solve(dp, s, p, i+1, j))
                return true;
        }
        
        else if(p[j] == '?' || s[i] == p[j])
            return dp[i][j] = solve(dp, s, p, i+1, j+1);

        return dp[i][j] = false;
        
    }
public:
    bool isMatch(string s, string p) {

        p = removeConsecutiveStars(p);
        vector<vector<int>> dp(s.size()+1, vector<int>(p.size()+1,-1));
        return solve(dp, s, p, 0, 0);




        // p = removeConsecutiveStars(p);
        // int m = s.size();
        // int n = p.size();
        // if(!m && !n)
        //     return true;
        // if(!n)
        //     return false;

        // vector<vector<bool>> dp(m+1, vector<bool>(n+1));
        // dp[m][n] = true;

        // if(p[n-1] == '*')
        //     dp[m][n-1] = true;

        // for(int i=m-1; i>=0; i--)
        // {
        //     for(int j=n-1; j>=0; j--)
        //     {
        //         if(p[j] == '*')
        //             dp[i][j] = dp[i][j+1] || dp[i+1][j];

        //         else if(p[j] == '?' || s[i] == p[j])
        //             dp[i][j] = dp[i+1][j+1];
        //     }
        // }

        // return dp[0][0];
    }
};
29193