Available question text
Design a prefix tree that supports insert, countWordsEqualTo, countWordsStartingWith, and erase operations, handling duplicate inserts/removals by maintaining node-level occurrence counts. Each operation should run in O(length of word or prefix) time by walking and updating counts along the trie path.
Related questions
Continue with questions that share topics or the same question type.
- Implement Trie (Prefix Tree)
Coding
- Implement an extensible prefix tree
Coding · Data Structure Design · Trees
- They asked me a prefix tree leetcode question
Coding
- All Nodes Distance K in Binary Tree
Coding · Binary Tree · Breadth-First Search · Depth-First Search
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1804. Implement Trie II (Prefix Tree)
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source