Regular expression matching
Implement regular-expression matching for patterns where '.' matches any single character and '*' matches zero or more of the PRECEDING element. The match must cover the ENTIRE input string s (not a partial match). 0 <= len(s) <= 1000, 0 <= len(p) <= 1000; s is lowercase letters, p is lowercase letters plus '.' and '*' (a '*' always has a valid preceding element). Example: s='mississippi', p='mis*is*p*.' -> False.
Implement
is_regex_match(s: str, p: str) → boolExamples
in
["mississippi","mis*is*p*."]outfalseWhat 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 34 min
solution.py
InputExpectedGot
["mississippi","mis*is*p*."]falsenot run yetsample