Ecommet

DSA sheet · Topic

Tries interview problems

Prefix trees: storing many words so that prefix lookups, wildcard searches and grid word hunts become fast.

  • 3 problems
  • Java + Python
  • Free, no sign-up
Progress options

11 Tries Prefix trees: storing many words so that prefix lookups, wildcard searches and grid word hunts become fast. 0 / 3
  1. 95 Implement Trie (Prefix Tree) Medium Practice Implement Trie (Prefix Tree) on LeetCode (opens in a new tab)
  2. 96 Design Add and Search Words Data Structure Medium Practice Design Add and Search Words Data Structure on LeetCode (opens in a new tab)
  3. 97 Word Search II Hard Practice Word Search II on LeetCode (opens in a new tab)

All topics