Solution: Wildcard Matching
Explore how to solve wildcard matching problems by implementing a greedy algorithm that efficiently matches patterns containing '?' and '*' against entire input strings. Understand the use of pointers and backtracking to ensure accurate matching with optimal 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.
Constraints:
s.length...