Wildcard matching
Given an input string s and a pattern p where p may contain '?' (matches any single character) and '*' (matches any sequence, including empty), return True iff p matches the ENTIRE string s. 0 <= len(s) <= 2000, 0 <= len(p) <= 2000, lowercase letters plus the wildcards in p. Example: s='adceb', p='*a*b' -> True.
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 26 min
solution.py
InputExpectedGot
["adceb","*a*b"]truenot run yetsample