DSAWiser

DSA question set · 160 questions

Trie DSA Practice Questions

Explore 160 DSA questions in Trie. Practice with DSAWiser’s code editor and visualizer.

TrieNode modelterminal flagsstructural invariantsCompressed edge slicesindex arithmeticWord Trieprefix traversalBinary/digit TrieSuffix Triedistinct substring nodesReversed-word Triesuffix existencesuffix countsaugmented traversaldictionary queriesBinary Triegreedy bit traversalcountslexicographical traversalstructural metricsDouble-array transition tracingSequential CAS simulationBurst Trie bucketscountingTernary search treepointer rotationPrefix-free codesexact weighted sumsprefix pass countsuniquenesswildcard branchingexactly-one-substitution searchwildcard backtrackingAugmented Trieprefix aggregate deltasterminal prefixestraversalsegmentationdynamic programmingstream suffix matchingoverlapping substring matchingSegment Triefolder ancestryString subsequence matchingPrefix and suffix filteringprefix matchingfrequency rankingdeletionnode pruningcommon substring matchingGrid backtracking prerequisiteRadix Triepath compressionPalindrome pairsdictionary matchingVowel normalizationXOR queriesoffline/tree/prefix techniquesoccurrence countsSubstring comparisondeduplicationdynamic stream matchingPalindromic prefixesstring algorithmsLOUDS representationdegree navigationSuffix LCEdirect string comparisongrid backtrackingmemoized segmentationenumerationprefix and suffix searchprefix candidatesbacktrackingAho-Corasickfailure linksoverlapping matchespalindrome pairsFolder Triesubtree signaturessimultaneous deletiondynamic autocompletePersistent binary Triepath copyingPersistent counted Trietree LCApath multiset subtraction

What’s in this set

The Trie collection contains 160 problems: 51 basic, 58 easy, 35 medium, 15 hard, 1 very hard. Choose a question at your current level, or follow the collection’s order below.

Topics in this collection include Trie, Node model, terminal flags, structural invariants, Compressed edge slices. Each question shows its own topics and difficulty so you can decide where to begin.

Practice with the code visualizer

  1. Open a question in the editor and read the statement, inputs, and expected output. Predict the result for a small example before writing code.
  2. Write a solution and run the examples. If a result differs from your prediction, reduce the input until you can follow each step.
  3. Step through your code in the visualizer. Use a breakpoint to inspect the state at a specific line, then compare it with your reasoning.

Questions in this set

160 total

Open a question in the editor to read its statement and examples. Sign in to practice.

  1. TrieNode InitializationTrie · Node model · terminal flags · structural invariantsBasic
  2. Single Child Pointer Existence CheckTrie · Node model · terminal flags · structural invariantsBasic
  3. Direct Child Node AttachmentTrie · Node model · terminal flags · structural invariantsBasic
  4. Assign the End-of-Word FlagTrie · Node model · terminal flags · structural invariantsBasic
  5. Count Immediate ChildrenTrie · Node model · terminal flags · structural invariantsBasic
  6. Empty Trie Root VerificationTrie · Node model · terminal flags · structural invariantsBasic
  7. Character to Alphabet IndexTrie · Node model · terminal flags · structural invariantsBasic
  8. Alphabet Index to CharacterTrie · Node model · terminal flags · structural invariantsBasic
  9. Single-Character Word InsertionTrie · Node model · terminal flags · structural invariantsBasic
  10. Single-Character Word SearchTrie · Node model · terminal flags · structural invariantsBasic
  11. List Immediate Child CharactersTrie · Node model · terminal flags · structural invariantsBasic
  12. Check Leaf TrieNodeTrie · Node model · terminal flags · structural invariantsBasic
  13. Reset End-of-Word FlagTrie · Node model · terminal flags · structural invariantsBasic
  14. Child Existence Through an API HelperTrie · Node model · terminal flags · structural invariantsBasic
  15. Check If Trie Has Any Stored WordsTrie · Node model · terminal flags · structural invariantsBasic
  16. Exact Path Node Count for Single WordTrie · Node model · terminal flags · structural invariantsBasic
  17. Check Whether a Traversal Step Is AvailableTrie · Node model · terminal flags · structural invariantsBasic
  18. Find Depth of a Linear TrieTrie · Node model · terminal flags · structural invariantsBasic
  19. Direct Child Overwrite PreventionTrie · Node model · terminal flags · structural invariantsBasic
  20. Check Root End-of-WordTrie · Node model · terminal flags · structural invariantsBasic
  21. TrieNode with Prefix Pass Count InitializationTrie · Node model · terminal flags · structural invariantsBasic
  22. Increment Node Pass CountTrie · Node model · terminal flags · structural invariantsBasic
  23. Decrement Node Pass CountTrie · Node model · terminal flags · structural invariantsBasic
  24. TrieNode Storing Explicit Character ValueTrie · Node model · terminal flags · structural invariantsBasic
  25. Check If Any Child Has End-of-Word FlagTrie · Node model · terminal flags · structural invariantsBasic
  26. Common Prefix Length Between Two Words in TrieTrie · Node model · terminal flags · structural invariantsBasic
  27. Detect Branching NodeTrie · Node model · terminal flags · structural invariantsBasic
  28. Total Nodes for Two Disjoint WordsTrie · Node model · terminal flags · structural invariantsBasic
  29. Total Nodes for Identical WordsTrie · Node model · terminal flags · structural invariantsBasic
  30. Total Nodes for One Word Being Prefix of AnotherTrie · Node model · terminal flags · structural invariantsBasic
  31. Follow Exact PathTrie · Node model · terminal flags · structural invariantsBasic
  32. Get Terminal Node of PrefixTrie · Node model · terminal flags · structural invariantsBasic
  33. Count Words of Length OneTrie · Node model · terminal flags · structural invariantsBasic
  34. Find First Available Alphabetical ChildTrie · Node model · terminal flags · structural invariantsBasic
  35. Find Last Available Alphabetical ChildTrie · Node model · terminal flags · structural invariantsBasic
  36. Remove Single Child PointerTrie · Node model · terminal flags · structural invariantsBasic
  37. Can Delete Leaf Node SafelyTrie · Node model · terminal flags · structural invariantsBasic
  38. Clear All Children of a NodeTrie · Node model · terminal flags · structural invariantsBasic
  39. Unmark Word Without Removing NodesTrie · Node model · terminal flags · structural invariantsBasic
  40. Check Single Child PathTrie · Node model · terminal flags · structural invariantsBasic
  41. Binary TrieNode InitializationTrie · Node model · terminal flags · structural invariantsBasic
  42. Binary Trie Bit InsertionTrie · Node model · terminal flags · structural invariantsBasic
  43. Digit TrieNode Child VerificationTrie · Node model · terminal flags · structural invariantsBasic
  44. Case-Insensitive Trie Index MappingTrie · Node model · terminal flags · structural invariantsBasic
  45. Maximum Branching Factor of English Lowercase TrieTrie · Node model · terminal flags · structural invariantsBasic
  46. Count Total Words in a Linear ChainTrie · Node model · terminal flags · structural invariantsBasic
  47. Height of a Single-Node TrieTrie · Node model · terminal flags · structural invariantsBasic
  48. Verify an Exact Word at Its Terminal NodeTrie · Node model · terminal flags · structural invariantsBasic
  49. Count Marked Words Among ChildrenTrie · Node model · terminal flags · structural invariantsBasic
  50. Validate Single Word Insertion StateTrie · Node model · terminal flags · structural invariantsBasic
  51. Patricia Edge Slice ArithmeticTrie · Compressed edge slices · index arithmeticBasic
  52. Standard Word InsertionTrie · Word Trie · prefix traversal · terminal flagsEasy
  53. Standard Word SearchTrie · Word Trie · prefix traversal · terminal flagsEasy
  54. Prefix Search (startsWith)Trie · Word Trie · prefix traversal · terminal flagsEasy
  55. Total Words CountTrie · Word Trie · prefix traversal · terminal flagsEasy
  56. Count Words with Given PrefixTrie · Word Trie · prefix traversal · terminal flagsEasy
  57. Longest Common Prefix of an Array of StringsTrie · Word Trie · prefix traversal · terminal flagsEasy
  58. Longest Prefix Match of QueryTrie · Word Trie · prefix traversal · terminal flagsEasy
  59. Check If Any Word Is a Prefix of AnotherTrie · Word Trie · prefix traversal · terminal flagsEasy
  60. Total Characters Saved by Prefix CompressionTrie · Word Trie · prefix traversal · terminal flagsEasy
  61. Lexicographically Sorted Word ListingTrie · Word Trie · prefix traversal · terminal flagsEasy
  62. Reverse Lexicographically Sorted Word ListingTrie · Word Trie · prefix traversal · terminal flagsEasy
  63. Find Shortest Word Length in TrieTrie · Word Trie · prefix traversal · terminal flagsEasy
  64. Find Longest Word Length in TrieTrie · Word Trie · prefix traversal · terminal flagsEasy
  65. Maximum Depth of TrieTrie · Word Trie · prefix traversal · terminal flagsEasy
  66. Count Words of Exact Length KTrie · Word Trie · prefix traversal · terminal flagsEasy
  67. Count Words with Length at Most KTrie · Word Trie · prefix traversal · terminal flagsEasy
  68. Count Words with Length at Least KTrie · Word Trie · prefix traversal · terminal flagsEasy
  69. Count Total Leaf NodesTrie · Word Trie · prefix traversal · terminal flagsEasy
  70. Count Branching NodesTrie · Word Trie · prefix traversal · terminal flagsEasy
  71. Delete Single Standalone WordTrie · Word Trie · prefix traversal · terminal flagsEasy
  72. Delete Word Sharing PrefixTrie · Word Trie · prefix traversal · terminal flagsEasy
  73. Delete Word Having Shorter Prefix StoredTrie · Word Trie · prefix traversal · terminal flagsEasy
  74. Replace Word with RootTrie · Word Trie · prefix traversal · terminal flagsEasy
  75. Check If All Query Words ExistTrie · Word Trie · prefix traversal · terminal flagsEasy
  76. Check If Two Tries Are IdenticalTrie · Word Trie · prefix traversal · terminal flagsEasy
  77. Count Common Words Between Two TriesTrie · Word Trie · prefix traversal · terminal flagsEasy
  78. Merge Two TriesTrie · Word Trie · prefix traversal · terminal flagsEasy
  79. Check If Trie A Is a Subset of Trie BTrie · Word Trie · prefix traversal · terminal flagsEasy
  80. Find Difference CountTrie · Word Trie · prefix traversal · terminal flagsEasy
  81. Prefix Match with Trailing WildcardTrie · Word Trie · prefix traversal · terminal flagsEasy
  82. Autocomplete First SuggestionTrie · Word Trie · prefix traversal · terminal flagsEasy
  83. Check If Trie Contains Any Palindromic Word of Length 2 or 3Trie · Word Trie · prefix traversal · terminal flagsEasy
  84. Binary Trie Insert and SearchTrie · Binary/digit Trie · prefix traversalEasy
  85. Count Binary Strings with Given Bit PrefixTrie · Binary/digit Trie · prefix traversalEasy
  86. Maximum Value in 4-Bit Binary TrieTrie · Binary/digit Trie · prefix traversalEasy
  87. Minimum Value in 4-Bit Binary TrieTrie · Binary/digit Trie · prefix traversalEasy
  88. Digit Trie Contact SearchTrie · Binary/digit Trie · prefix traversalEasy
  89. Suffix Trie InsertionTrie · Suffix Trie · distinct substring nodesEasy
  90. Check If String Is a Suffix of Any WordTrie · Reversed-word Trie · suffix existenceEasy
  91. Find Words Ending with CharacterTrie · Reversed-word Trie · suffix countsEasy
  92. Count Words with Same Start and End CharacterTrie · Word Trie · prefix traversal · terminal flagsEasy
  93. Distinct Prefixes CountTrie · Word Trie · prefix traversal · terminal flagsEasy
  94. Most Frequent Starting CharacterTrie · Word Trie · prefix traversal · terminal flagsEasy
  95. Check If Trie Has Only Single-Path WordsTrie · Word Trie · prefix traversal · terminal flagsEasy
  96. Pre-Order Trie Traversal SerializationTrie · Word Trie · prefix traversal · terminal flagsEasy
  97. Maximum Word Prefix OverlapTrie · Word Trie · prefix traversal · terminal flagsEasy
  98. Comprehensive Trie Summary StatisticsTrie · Word Trie · prefix traversal · terminal flagsEasy
  99. Autocomplete All Words Matching PrefixTrie · Word Trie · augmented traversal · dictionary queriesEasy
  100. Replace Words in Sentence by RootTrie · Word Trie · augmented traversal · dictionary queriesEasy
  101. Longest Common Bit Prefix of Fixed-Length Binary StringsTrie · Binary Trie · greedy bit traversal · countsEasy
  102. Lexicographically K-th Smallest WordTrie · Word Trie · lexicographical traversalEasy
  103. Count Words with Given Suffix Using Reversed TrieTrie · Reversed-word Trie · suffix countsEasy
  104. Maximum Branching Factor and Average Word DepthTrie · Word Trie · structural metricsEasy
  105. Double-Array Trie (DAT) State Transition and ValidationTrie · Double-array transition tracingEasy
  106. Sequential Compare-and-Swap SimulationTrie · Sequential CAS simulationEasy
  107. Burst Trie Bucket Partition CountsTrie · Burst Trie buckets · countingEasy
  108. Ternary Search Tree: Single Left Rotation LinksTrie · Ternary search tree · pointer rotationEasy
  109. Prefix-Free Code Length and Kraft EqualityTrie · Prefix-free codes · exact weighted sumsEasy
  110. Shortest Unique Prefix for a Single QueryTrie · Word Trie · prefix pass counts · uniquenessMedium
  111. Exact Single Wildcard MatchTrie · Word Trie · wildcard branchingMedium
  112. Word Distance by One Character SubstitutionTrie · Word Trie · exactly-one-substitution searchMedium
  113. Multi-Wildcard Pattern SearchTrie · Word Trie · wildcard backtrackingMedium
  114. Map Sum Pairs (Prefix Value Aggregation)Trie · Augmented Trie · prefix aggregate deltasMedium
  115. Shortest Unique Prefix for Every WordTrie · Word Trie · prefix pass counts · uniquenessMedium
  116. Maximum XOR of Two Numbers in an ArrayTrie · Binary Trie · greedy bit traversal · countsMedium
  117. Maximum XOR with Query ValueTrie · Binary Trie · greedy bit traversal · countsMedium
  118. Minimum XOR Pair in an ArrayTrie · Binary Trie · greedy bit traversal · countsMedium
  119. Count Numbers with XOR Less Than KTrie · Binary Trie · greedy bit traversal · countsMedium
  120. Longest Word in Dictionary Built One Letter at a TimeTrie · Word Trie · terminal prefixes · traversalMedium
  121. Word Break Segmentation Using TrieTrie · Word Trie · segmentation · dynamic programmingMedium
  122. Stream of Characters (Suffix Query in Stream)Trie · Reversed-word Trie · stream suffix matchingMedium
  123. Count Distinct Substrings via Suffix TrieTrie · Suffix Trie · distinct substring nodesMedium
  124. Index Pairs of a StringTrie · Word Trie · overlapping substring matchingMedium
  125. Magic Dictionary (One-Edit Search)Trie · Word Trie · exactly-one-substitution searchMedium
  126. Remove Sub-Folders from FilesystemTrie · Segment Trie · folder ancestryMedium
  127. Camelcase MatchingTrie · String subsequence matchingMedium
  128. Words with Exact Prefix and SuffixTrie · Prefix and suffix filteringMedium
  129. Top-K Frequent Words with PrefixTrie · Word Trie · prefix matching · frequency rankingMedium
  130. Recursive Bottom-Up Node Pruning on DeletionTrie · Word Trie · deletion · node pruningMedium
  131. Concatenated Word CheckTrie · Word Trie · segmentation · dynamic programmingMedium
  132. Longest Common Substring of Two Strings via Suffix TrieTrie · Suffix Trie · common substring matchingMedium
  133. Word Search with Four-Direction AdjacencyTrie · Grid backtracking prerequisiteMedium
  134. Radix / Compressed Trie Node CountTrie · Radix Trie · path compressionMedium
  135. Palindrome Pair DetectionTrie · Palindrome pairs · dictionary matchingMedium
  136. Spell Checker with Vowel Error TolerationTrie · Vowel normalization · dictionary matchingMedium
  137. Maximum XOR SubarrayTrie · Binary Trie · XOR queries · offline/tree/prefix techniquesMedium
  138. Maximum XOR Across Two ArraysTrie · Binary Trie · XOR queries · offline/tree/prefix techniquesMedium
  139. Longest Duplicate Substring Length via Suffix TrieTrie · Suffix Trie · occurrence countsMedium
  140. Count Distinct Echo SubstringsTrie · Substring comparison · deduplicationMedium
  141. Stream Suffix Substring Matching with Dynamic VocabularyTrie · Reversed-word Trie · dynamic stream matchingMedium
  142. Shortest Palindrome via Prefix Trie Suffix SymmetryTrie · Palindromic prefixes · string algorithmsMedium
  143. LOUDS Degree-Block NavigationTrie · LOUDS representation · degree navigationMedium
  144. Longest Common Extension Queries on Two StringsTrie · Suffix LCE · direct string comparisonMedium
  145. Word Search II (Find All Dictionary Words on a 2D Board)Trie · Word Trie · grid backtrackingHard
  146. Word Break II (Reconstruct All Valid Sentences)Trie · Word Trie · memoized segmentation · enumerationHard
  147. Prefix and Suffix Search (WordFilter Engine)Trie · Word Trie · prefix and suffix searchHard
  148. Word Squares ConstructionTrie · Word Trie · prefix candidates · backtrackingHard
  149. Multi-Word Aho-Corasick String MatchingTrie · Aho-Corasick · failure links · overlapping matchesHard
  150. Maximum XOR With an Element From Array Under Value ConstraintTrie · Binary Trie · XOR queries · offline/tree/prefix techniquesHard
  151. Count Pairs with XOR in a Given Range [low, high]Trie · Binary Trie · XOR queries · offline/tree/prefix techniquesHard
  152. Maximum Genetic Difference QueryTrie · Binary Trie · XOR queries · offline/tree/prefix techniquesHard
  153. Palindrome Pairs (All Distinct Index Pairs)Trie · Reversed-word Trie · palindrome pairsHard
  154. Concatenated Words in a Large DictionaryTrie · Word Trie · segmentation · dynamic programmingHard
  155. Delete Duplicate Folders in System via Subtree HashingTrie · Folder Trie · subtree signatures · simultaneous deletionHard
  156. Search Autocomplete System with Frequency RankingTrie · Word Trie · dynamic autocomplete · frequency rankingHard
  157. Maximum Subarray XOR with Length At Most KTrie · Binary Trie · XOR queries · offline/tree/prefix techniquesHard
  158. K-th Smallest Subarray XORTrie · Binary Trie · XOR queries · offline/tree/prefix techniquesHard
  159. Fully Persistent Binary Trie (Versioned Path-Copying)Trie · Persistent binary Trie · path copyingHard
  160. Persistent Binary Trie Path XOR on a TreeTrie · Persistent counted Trie · tree LCA · path multiset subtractionVery hard