Wildcard Matching
Explore how to implement wildcard matching for strings using special characters '?' and '*'. Learn to apply greedy techniques to verify if a given pattern fully matches an input string. This lesson helps you understand problem constraints and develop efficient solutions for coding interview questions involving pattern matching.
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. ...