Trie

Trie Concepts

Trie Definition

• Implement Trie (Prefix Tree) * | Auto-complete feature using Trie |
• Longest Common Prefix !

Practical Application I

• • Map Sum Pairs | Replace Words | Prefix and Suffix Search
  • Add and Search Word – Data structure design *
  • Design Search Autocomplete System
  • Number of Distinct Substrings in a String

Practical Application II

• • Word Search II * | Word Break * |  Word Squares | Palindrome Pairs |
  • Search Suggestions System | Count Distinct Rows in a Binary Matrix
  • Bitwise Trie:
    • Maximum XOR of Two Numbers in an Array
    • Maximum XOR With an Element From Array