bugl
bugl
HomeLearnPatternsPathsSearchPremium
HomeLearnPatternsPaths
MediumTriesLC 211

Design Add And Search Words Data Structure

Design a data structure that supports adding new words and finding if a string matches any previously added string. Implement the WordDictionary class: WordDictionary() Initializes the object. void addWord(word) Adds word to the data structure, it can be matched later. bool search(word) Returns true if there is any string in the data structure that matches word or false otherwise. word may contain dots '.' where dots can be matched with any letter. Example: Input "WordDictionary ", "addWord ", "addWord ", "addWord ", "search ", "search ", "search ", "search " \[, "bad ", "dad ", "mad ", "pad ", "bad ", ".ad ",\[ "b..

Hints
  • 1.Think about what data structure fits Design Add And Search Words Data Structure
  • 2.Consider the brute force complexity and how to optimize
  • 3.Can you trade space for time?
LeetCodeNeetCode