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

     int f(int i, int j, string &p, string &s, vector<vector<int>> &dp) {
        // Base cases
        if (i < 0 && j < 0) return 1; // Both strings exhausted -> match
        if (i < 0) return 0; // Pattern exhausted but string remains -> no match
        if (j < 0) { 
            // If pattern has remaining *, it can still match
            while (i >= 0 && p[i] == '*') i--;
            return (i < 0);
        }

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

        // Match or not match
        if (p[i] == s[j] || p[i] == '?') 
            return dp[i][j] = f(i - 1, j - 1, p, s, dp);

        if (p[i] == '*') 
            return dp[i][j] = f(i - 1, j, p, s, dp) || f(i, j - 1, p, s, dp);

        return dp[i][j] = 0; // No match
    }
    
    bool isMatch(string s, string p) {
        

        int n = p.size();
        int m  = s.size();
        vector<vector<int>> dp(n,vector<int> (m,-1));
        return f(n-1,m-1,p,s,dp);

    }
};
30674