Implement Trie search with wildcard matching

Q: Implement Trie search with wildcard matching

This is a Coding & Algorithms interview question from Trexquant for Software Engineer roles. View the full question and solution on PracHub.

Q: How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

Question

Design a text dictionary using a Trie.

Support the following operations:

addWord(word) : Insert a lowercase English word.
search(pattern) : Return true if any previously added word matches pattern .

The pattern may contain the wildcard character . which matches exactly one lowercase letter. (All other characters match themselves.)

Inputs/Outputs

You may implement a class with these two methods, or write functions that process a sequence of operations.

Constraints

Number of operations up to ~10^5.
Word/pattern length up to ~10^3 (assume typical interview constraints; optimize beyond naive scanning).
Must be implemented in C++.

Implement Trie search with wildcard matching

Inputs/Outputs

Constraints

Comments (0)