Support adding words and searching a pattern where a dot can match any one character.
A good solution should
- State the invariant or decision rule that makes the approach correct.
- Explain the time and space complexity in terms of the input sizes and required output.
- Handle empty, minimal, duplicate, and boundary-shaped inputs covered by the contract.
Reasoning prompt
A literal follows one trie edge; a wildcard branches across child edges. Bound branching using pattern length and trie structure.
Use the linked judge for the canonical problem. The examples above are compact TRT checks; write additional cases before submitting, especially for the boundary that tends to break your chosen invariant.