Solution: Wildcard Matching
Understand how to solve the wildcard matching problem by applying greedy techniques with two-pointer scanning and backtracking. Learn to process patterns with '?' and '*' characters to determine if they entirely match a given string while optimizing time and 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.
...