Solution: Wildcard Matching
Explore how to solve the wildcard matching problem using a greedy algorithm. Understand how to match patterns with '?' and '*' characters to entire input strings by scanning and backtracking smartly. This lesson teaches an efficient method to determine if a pattern fully matches a string, optimizing for 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.
...