😀
OJ Practices
Ctrlk
  • 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
Powered by GitBook
On this page

Was this helpful?

  1. Leetcode

Trie

208 Implement Trie (Prefix Tree)211 Add and Search Word - Data structure design212 Word Search II336 Palindrome Pairs421 Maximum XOR of Two Numbers in an Array425 Word Squares472 Concatenated Words527 Word Abbreviation588 Design In-Memory File System642 Design Search Autocomplete System648 Replace Words676 Implement Magic Dictionary677 Map Sum Pairs692 Top K Frequent Words720 Longest Word in Dictionary745 Prefix and Suffix Search
Previous959 Regions Cut By SlashesNext208 Implement Trie (Prefix Tree)

Last updated 5 years ago

Was this helpful?