Solution: Wildcard Matching
Explore the greedy algorithm for wildcard matching that uses '?' and '*' to match strings completely. Understand its pointer-based technique for efficient matching and backtracking, enabling you to solve this common pattern matching problem with optimal time and space use.
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.
...