GeetCode Hub

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.




WordDictionary wordDictionary = new WordDictionary();
wordDictionary.addWord("mad");"pad"); // return False"bad"); // return True".ad"); // return True"b.."); // return True



  • 1 <= word.length <= 500
  • word in addWord consists lower-case English letters.
  • word in search consist of  '.' or lower-case English letters.
  • At most 50000 calls will be made to addWord and search.

class WordDictionary { /** Initialize your data structure here. */ public WordDictionary() { } public void addWord(String word) { } public boolean search(String word) { } } /** * Your WordDictionary object will be instantiated and called as such: * WordDictionary obj = new WordDictionary(); * obj.addWord(word); * boolean param_2 =; */