OJ
Ctrlk
  • Introduction
  • Some Tips
  • strStr and Coding Style
  • Binary Search
  • Binary Tree & Divide Conquer
  • Dynamic Programming I
  • Dynamic Programming II
  • Linked List
  • Array & Numbers
  • Heap
  • Hash
  • Multiple Pointers
  • Stack
  • Breadth-first Search
  • Bit Manipulation
  • Math
  • Trie
    • Replace Words
    • 208. Implement Trie (Prefix Tree)
    • 211. Add and Search Word - Data structure design
    • 1032. Stream of Characters
    • 745. Prefix and Suffix Search
    • Word Search II
    • 425. Word Squares
    • 642. Design Search Autocomplete System
  • Graph
  • Union Find
  • Exhaustive Search
  • String
  • Greedy
  • Design
  • Queue
Powered by GitBook
On this page

Was this helpful?

Trie

Replace Words208. Implement Trie (Prefix Tree)211. Add and Search Word - Data structure design1032. Stream of Characters745. Prefix and Suffix SearchWord Search II425. Word Squares642. Design Search Autocomplete System
Previous381. Insert/Del GetRandom O(1)-Duplicates allowedNextReplace Words

Last updated 6 years ago

Was this helpful?