Skip to main content
CodePeet

CodePeet 700 Complete DSA Sheet

Tries Quiz

Editorial

16 questions across the three Tries lessons and the section's problems: one node per prefix, search against startsWith, counts and erase, a dot that tries every child, words built a prefix at a time and substrings as prefixes of suffixes; then one walk for many words on a board, found words and cut branches, a stream read from its newest letter; then the bit trie, the opposite bit, the width and queries with a limit. Pick an answer to see whether it's right and why. Nothing is saved, so you can take it again.

If one trips you up, its lesson is Introduction to Tries, Tries for Searching Many Words or Bitwise Tries: Maximum XOR.

Quiz

1 / 16

Multiple choice

A trie gets insert("rose"), insert("rope"), insert("rot") and insert("row"). How many nodes does it have besides the root?