Wildcard dictionary search
Build a dictionary from the list words, then answer a list of search queries. A query is a string that may contain the wildcard character '.', which matches any single letter; a regular letter must match exactly. Return a list of booleans, one per query, indicating whether some word in the dictionary matches the entire query (same length, all positions satisfied). Words and queries contain only lowercase letters and '.'.
Implement
trie_wildcard_search(words: list[str], queries: list[str]) → list[bool]Examples
in
[["bad","dad","mad"],["pad","bad",".ad","b.."]]out[false,true,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
[["bad","dad","mad"],["pad","bad",".ad","b.."]][false,true,true,true]not run yetsample