Wildcard pattern matching
Implement wildcard pattern matching where '?' matches any single character and '*' matches any sequence of characters (including the empty sequence). The match must cover the ENTIRE input string s (not partial). s contains only lowercase letters; p contains lowercase letters, '?' and '*'. Return True if p matches s. 0 <= len(s), len(p) <= 2000.
Implement
wildcard_match(s: str, p: str) → boolExamples
in
["adceb","*a*b"]outtrueWhat a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 30 min
solution.py
InputExpectedGot
["adceb","*a*b"]truenot run yetsample