Solution: Wildcard Matching
Explore how to implement a wildcard pattern matcher that uses '?' and '*' characters to match entire input strings. Understand the greedy strategy with two pointers and backtracking to efficiently solve the problem without reprocessing characters, ensuring full pattern coverage of the string.
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.
...