DSA learning path
Tries
Prefix trees, autocomplete and dictionary-guided search.
Problems in this path
- Longest Common PrefixOpen
Easy · Prefix Walk - Count Prefix MatchesOpen
Medium · Trie Counters - Word Search in a GridOpen
Hard · Trie-style Backtracking - Replace Words with Trie RootsOpen
Medium · Shortest Prefix Trie - Wildcard Dictionary QueriesOpen
Hard · Trie DFS with Wildcards - Autocomplete SuggestionsOpen
Medium · Prefix Trie Enumeration - Count Distinct SubstringsOpen
Hard · Suffix Trie - Longest Buildable WordOpen
Medium · Trie Prefix Validation - Sum of Prefix ScoresOpen
Medium · Trie Visit Counts - Map Sum Prefix ValuesOpen
Medium · Trie Aggregate Values