Solution: Wildcard Matching
Understand how to solve the wildcard matching problem by implementing a greedy algorithm that uses two pointers and backtracking to match patterns containing '?' and '*'. This lesson explains how to handle matches and mismatches to determine if the entire pattern covers the input string efficiently.
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.
...