Kata

Design a data structure that supports the following two operations:

• addWord / add_word which adds a word,
• search which searches a literal word or a regular expression string containing lowercase letters "a-z" or "." where "." can represent any letter. Return true if the search term fully matches any word previously added; otherwise, return false.

You may assume that all given words contain only lowercase letters.

Examples

addWord("bad")
addWord("dad")
addWord("mad")

search("pad") === false
search("bad") === true
search(".ad") === true
search("b..") === true

wd = WordDictionary()

wd.add_word("bad")
wd.add_word("dad")
wd.add_word("mad")

wd.search("pad") == False
wd.search("bad") == True
wd.search(".ad") == True
wd.search("b..") == True

wd = WordDictionary.new

wd.add_word("bad")
wd.add_word("dad")
wd.add_word("mad")

wd.search("pad") == false
wd.search("bad") == true
wd.search(".ad") == true
wd.search("b..") == true

Note: the data structure will be initialized multiple times during the tests!