trie
dz / leetcode / explore / trieSubgraphs
Node Tree
Nodes
1_introduction | |
content | Introduction |
parents | leetcode/explore/trie |
hyperlink | https://leetcode.com/explore/learn/card/trie/150/introduction-to-trie/ |
location | knowledge/leetcode/trie.dz:10 |
2_basic_operations | |
children | leetcode/problems/208_implement_trie |
parents | leetcode/explore/trie |
hyperlink | https://leetcode.com/explore/learn/card/trie/147/basic-operations/ |
location | knowledge/leetcode/trie.dz:39 |
3_practical_application_1 | |
content | Practical Applications, part 1 |
children | leetcode/problems/642_design_search_autocomplete_system, leetcode/problems/648_replace_words, 3_practical_application_1/autocomplete, leetcode/problems/677_map_sum_pairs, 3_practical_application_1/prefix_keywords, leetcode/problems/211_design_add_and_search_words_data_structure, 3_practical_application_1/spell_checker |
parents | leetcode/explore/trie |
hyperlink | https://leetcode.com/explore/learn/card/trie/148/practical-application-i/ |
location | knowledge/leetcode/trie.dz:54 |
2025-01-06 10:45 explore card wrap-up There's actually more structure here to document in DZ.
4_practical_application_2 | |
content | Practical Applications, part 2 |
children | 4_practical_application_2/accelerate_dfs, 4_practical_application_2/store_other_data_type, leetcode/problems/79_word_search, leetcode/problems/336_palindrome_pairs, leetcode/problems/421_max_XOR_two_numbers, leetcode/references/longest_prefix_match (Other use cases for Trie include IP routing), leetcode/problems/212_word_search_2 |
parents | leetcode/explore/trie |
hyperlink | https://leetcode.com/explore/learn/card/trie/149/practical-application-ii/ |
location | knowledge/leetcode/trie.dz:83 |
2025-01-06 10:45 onto practical application 2