802. Wildcard Matching (Recursive + Memo)

Given s and pattern p with '?' (single char) and '*' (any sequence including empty), return true if p matches entire s. Implement with recursion + memoization.

Input: Two quoted strings.

Output: Boolean.

Examples

Input: "adceb", "*a*b"
Output: true
Explanation: * matches empty, a matches a, * matches dce, b matches b.

Input: "acdcb", "a*c?b"
Output: false
Explanation: No valid matching.

Constraints

• 0 <= s.length <= 20
• 0 <= p.length <= 20

Asked by