Solution: Wildcard Matching
Understand how to implement a wildcard pattern matching solution with two special characters '?' and '*'. Explore a greedy strategy that scans the input and pattern with pointers, uses backtracking to handle mismatches, and achieves efficient matching of entire strings with optimal time and constant space complexity.
We'll cover the following...
Statement
Given an input string, s, and a pattern string, p, implement wildcard pattern matching that determines if the pattern matches the entire input string.
The pattern supports two special wildcard characters:
'?': Matches exactly one arbitrary character.'*': Matches any sequence of characters (including zero characters).
The match must be complete, meaning the pattern should cover the entire input string, not just a part of it.
Return TRUE if the pattern matches the whole string; otherwise, return FALSE.
...