πŸ˜€
OJ Practices
search
⌘Ctrlk
πŸ˜€
OJ Practices
  • Introduction
  • Leetcode
    • Tree
    • Dynamic Programming
    • Depth-First-Search
    • Breadth-First Search
    • Two Pointers
    • Linked List
    • Backtracking
    • Binary Search
    • Union Find
    • Trie
      • 208 Implement Trie (Prefix Tree)
      • 211 Add and Search Word - Data structure design
      • 212 Word Search II
      • 336 Palindrome Pairs
      • 421 Maximum XOR of Two Numbers in an Array
      • 425 Word Squares
      • 472 Concatenated Words
      • 527 Word Abbreviation
      • 588 Design In-Memory File System
      • 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
    • Sort
    • Heap
    • Randomness
    • Topological Sort
    • Stack
    • Hash Table
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-right212 Word Search IIchevron-right336 Palindrome Pairschevron-right421 Maximum XOR of Two Numbers in an Arraychevron-right425 Word Squareschevron-right472 Concatenated Wordschevron-right527 Word Abbreviationchevron-right588 Design In-Memory File Systemchevron-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
Previous959 Regions Cut By Slasheschevron-leftNext208 Implement Trie (Prefix Tree)chevron-right

Last updated 6 years ago