>ExpInterview_

Design Add And Search Words Data Structure

Medium
TrieDesignDFS

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 1:

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]

Examples

Input: values = [[],["bad"],["dad"],["mad"],["pad"],["bad"],[".ad"],["b.."]], operations = ["WordDictionary","addWord","addWord","addWord","search","search","search","search"]
Output: [null,null,null,null,false,true,true,true]
Input: values = [[],["a"],["a"]], operations = ["WordDictionary","addWord","search"]
Output: [null,null,true]
Input: values = [[],["a"],["."]], operations = ["WordDictionary","addWord","search"]
Output: [null,null,true]

Constraints

  • •1 <= word.length <= 25
  • •word in addWord consists of lowercase English letters.
  • •word in search consist of '.' or lowercase English letters.
  • •There will be at most 3 dots in word for search queries.
  • •At most 10^4 calls will be made to addWord and search.