OJ
search
Ctrlk
  • Introduction
  • Some Tips
  • strStr and Coding Style
  • Binary Searchchevron-right
  • Binary Tree & Divide Conquerchevron-right
  • Dynamic Programming Ichevron-right
  • Dynamic Programming IIchevron-right
  • Linked Listchevron-right
  • Array & Numberschevron-right
  • Heapchevron-right
  • Hashchevron-right
  • Multiple Pointerschevron-right
  • Stackchevron-right
  • Breadth-first Searchchevron-right
  • Bit Manipulationchevron-right
  • Mathchevron-right
  • Triechevron-right
    • Replace Words
    • 208. Implement Trie (Prefix Tree)
    • 211. Add and Search Word - Data structure designchevron-right
    • 1032. Stream of Characters
    • 745. Prefix and Suffix Search
    • Word Search II
    • 425. Word Squares
    • 642. Design Search Autocomplete System
  • Graphchevron-right
  • Union Findchevron-right
  • Exhaustive Searchchevron-right
  • Stringchevron-right
  • Greedychevron-right
  • Designchevron-right
  • Queuechevron-right
gitbookPowered by GitBook
block-quoteOn this pagechevron-down

Trie

Replace Wordschevron-right208. Implement Trie (Prefix Tree)chevron-right211. Add and Search Word - Data structure designchevron-right1032. Stream of Characterschevron-right745. Prefix and Suffix Searchchevron-rightWord Search IIchevron-right425. Word Squareschevron-right642. Design Search Autocomplete Systemchevron-right
Previous381. Insert/Del GetRandom O(1)-Duplicates allowedchevron-leftNextReplace Wordschevron-right

Last updated 6 years ago