Trees line
Tries problems
A trie stores words letter by letter, so words that begin the same share a path. It answers prefix questions, such as autocomplete, by walking only the letters typed.
- 2 medium
- 1 hard
The 3 problems
In the order the app teaches them. Each page has the problem, five hints and the explained solution.
On the roadmap
Tries is a station on the trees line. It builds on Trees. Next comes Heap / Priority Queue.
The roadmap says why each line runs in its order.
Patterns
One pattern solves these problems. Naming them gives the problems’ methods away, so the list is folded.
Show it
- Trie3 problems