<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 {
  std::vector<std::vector<short>> dp;

public:
  bool isMatch(std::string s, std::string p) {
    dp = std::vector<std::vector<short>>(s.size(),
                                         std::vector<short>(p.size(), -1));
    return fn(s, p, 0, 0);
  }
  bool fn(std::string_view const str, std::string_view const pat, int s,
          int p) {
    if (p == pat.size()) {
      return s == str.size();
    }
    if (s == str.size()) {
      return std::all_of(pat.begin() + p, pat.end(),
                         [](auto const a) { return a == '*'; });
    }
    if (dp[s][p] != -1) {
      return dp[s][p];
    }
    if (str[s] == pat[p] || pat[p] == '?') {
      return dp[s][p] = fn(str, pat, s + 1, p + 1);
    }
    if (pat[p] == '*') {
      return dp[s][p] = fn(str, pat, s + 1, p) || fn(str, pat, s, p + 1);
    }
    return dp[s][p] = false;
  }
};
22971