Day 56¶
Python solutions and study notes by Charles.
Trie: nested dictionaries, wildcard search, and board backtracking.
| Problem / Note | Difficulty |
|---|---|
| 208. Implement Trie (Prefix Tree) | Medium |
| 211. Design Add and Search Words Data Structure | Medium |
| 212. Word Search II | Hard |
Start with exact and prefix lookup, extend lookup to wildcard DFS, then combine trie pruning with board backtracking. Each article follows Charles's supplied code.