Wildcard dictionary search
Implement a dictionary that supports adding words and searching with the '.' wildcard, where '.' matches any single letter. Given a list of operations where ['add', w] inserts a word and ['search', p] queries whether any stored word matches pattern p (same length, with '.' as a wildcard), return a list of booleans, one per search, in order.
Implement
wildcard_dictionary(ops: list[list]) → list[bool]Examples
in
[[["add","bad"],["add","dad"],["add","mad"],["search","pad"],["search",".ad"],["search","b.."]]]out[false,true,true]What 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 25 min
solution.py
InputExpectedGot
[[["add","bad"],["add","dad"],["add","mad"],["search","pad"],["search",".ad"],["search","b.."]]][false,true,true]not run yetsample