Medium
Add and Search Words:Follow the Letter, Branch on the Dot
A catalog scan with per-character dots is honest. The intended walk is the same insert as Implement Trie; `.` DFS-es children — not a regex compile.
Read MoreTries
4 questions
No easy questions for Tries yet.
-
- Medium
Implement Trie:Walk the Key, Mark the End
A HashSet makes exact search cheap; startsWith still scans every stored key. The intended walk creates missing edges and trusts the end mark.
Read More - Medium
Search Suggestions:Three Sorted Hits on the Node, Not a Catalog Scan
Filter-sort-take-three on every keystroke is honest; the intended trie keeps three lex-smallest products on each node so query does not DFS the subtree.
Read More
Learn the structure
Representation and operations — not the problem set.