Code Room
CodingMedium
Question
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.
Learn the concepts
Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.
Run or narrate your approach, then ask the coach.