Add and Search Word - Data structure design

Design a data structure that supports the following two operations:

void addWord(word)
bool search(word)

search(word) can search a literal word or a regular expression string containing only letters a-z or .. A . means it can represent any one letter.

For example:

search("pad") -> false
search("bad") -> true
search(".ad") -> true
search("b..") -> true

You may assume that all words are consist of lowercase letters a-z.

Login to see Answer and Coaching Session More interview questions