<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:
    bool find(string &a,int n,string &b,int m,vector<vector<int>> &dp)
    {
        if(n<0)
        {
            while(m>=0)
            {
                if(b[m--]!='*')
                    return false;
            }
            return true;
        }
        if(m<0)
            return false;

        if(dp[n][m]!=-1)
            return dp[n][m];


        if(a[n]==b[m])
            return dp[n][m]= find(a,n-1,b,m-1,dp);
        else 
        {
            

            if(b[m]=='*')
            {
                if(m && b[m-1]=='*')
                return dp[n][m]= find(a,n,b,m-1,dp);
                else
                return dp[n][m]= find(a,n-1,b,m,dp)||find(a,n,b,m-1,dp);
            }
            else if(b[m]=='?')
                return dp[n][m]= find(a,n-1,b,m-1,dp);
            else return dp[n][m]= false;
        }
    }


    bool isMatch(string a, string b) {
        int n=a.length();
        int m=b.length();
        // vector<vector<int>> dp(n,vector<int>(m,-1));
        // return find(s,n-1,p,m-1,dp);

        //Tabulation
        vector<int> prev(m+1,0);
        int j=1;
        while(b[j-1]=='*')
            prev[j++]=true;
        prev[0]=true;

        for(int i=1;i<=n;i++)
        {
            vector<int> curr(m+1,0);
            for(int j=1;j<=m;j++)
            {
                if(a[i-1]==b[j-1])
                    curr[j]=prev[j-1];
                else
                {
                    if(b[j-1]=='*')
                    {
                        if(j-2>=0 && b[j-2]=='*')
                            curr[j]=curr[j-1];
                        else
                        {
                            curr[j]= prev[j] || curr[j-1] ;
                        }
                    }
                    else if(b[j-1]=='?')
                        curr[j]=prev[j-1];
                    else curr[j]=false;
                }
            }prev=curr;
        }
        return prev[m];
    }
};
29785