Design a data structure that supports adding new words and searching for words.
Search queries may contain the dot character '.',
which can match any letter.
Operations are provided as arrays for simplified execution.
Input:
["WordDictionary","addWord","addWord","addWord","search","search","search","search"]
[[],["bad"],["dad"],["mad"],["pad"],["bad"],[".ad"],["b.."]]
Output: [null,null,null,null,false,true,true,true]
Your program must print the output array exactly in the expected format.
No submissions yet.
Discuss Trie traversal with wildcards, DFS search, and performance considerations.