Algorithm Practice
search
Ctrlk
  • Introduction
  • Lintcodechevron-right
  • Leetcodechevron-right
    • Mathchevron-right
    • Treechevron-right
    • Graphchevron-right
    • Two Pointerschevron-right
    • Linked Listchevron-right
    • Topological Sortchevron-right
    • Hash Tablechevron-right
    • Triechevron-right
      • 208 Implement Trie (Prefix Tree)
      • 211 Add and Search Word - Data structure design
      • 336 Palindrome Pairs
      • 421 Maximum XOR of Two Numbers in an Array
      • 472 Concatenated Words
      • 642 Design Search Autocomplete System
      • 648 Replace Words
      • 676 Implement Magic Dictionary
      • 677 Map Sum Pairs
      • 692 Top K Frequent Words
      • 720 Longest Word in Dictionary
      • 745 Prefix and Suffix Search
    • Sortchevron-right
    • Binary Searchchevron-right
    • Heapchevron-right
    • Breadth First Searchchevron-right
    • Stackchevron-right
    • Backtrackingchevron-right
    • Dynamic Programmingchevron-right
    • Union Findchevron-right
    • Scan Line
    • Stringchevron-right
    • Reservoir Samplingchevron-right
    • Recursionchevron-right
  • Googlechevron-right
gitbookPowered by GitBook
block-quoteOn this pagechevron-down
  1. Leetcode

Trie

208 Implement Trie (Prefix Tree)chevron-right211 Add and Search Word - Data structure designchevron-right336 Palindrome Pairschevron-right421 Maximum XOR of Two Numbers in an Arraychevron-right472 Concatenated Wordschevron-right642 Design Search Autocomplete Systemchevron-right648 Replace Wordschevron-right676 Implement Magic Dictionarychevron-right677 Map Sum Pairschevron-right692 Top K Frequent Wordschevron-right720 Longest Word in Dictionarychevron-right745 Prefix and Suffix Searchchevron-right
Previous760 Find Anagram Mappingschevron-leftNext208 Implement Trie (Prefix Tree)chevron-right

Last updated 5 years ago

Was this helpful?

Was this helpful?