Skip to content
Avio Lines
D19

Tries

10 stations · 7.1h

Prefix trees for word search and XOR problems. 10 interview problems explained by codestorywithMIK (7.1h of video), grouped into 4 patterns such as Trie Implementation, Prefix Search & Autocomplete, Word Search with Trie.

Start this line →
problems by zone (pattern)
  • Trie Implementation3
  • Prefix Search & Autocomplete6
  • Word Search with Trie1
  • Bitwise Trie (Max XOR)1

  1. Trie Implementation

    0 of 3 passed
  2. Implement Trie (Prefix Tree)LC 208 · 31:00
    MediumGoogle · Amazon · +19 more companiesLeetCode ↗ (opens in a new tab)
  3. Longest Common Suffix QueriesLC 3093 · 48:34
    HardGoogle · AmazonLeetCode ↗ (opens in a new tab)
  4. Delete Duplicate Folders in SystemLC 1948 · 1:18:04
    HardGoogle · Amazon · +4 more companiesLeetCode ↗ (opens in a new tab)

  5. Prefix Search & Autocomplete

    0 of 6 passed
  6. Implement Trie (Prefix Tree)LC 208 · 31:00
    MediumGoogle · Amazon · +19 more companiesLeetCode ↗ (opens in a new tab)
  7. Replace WordsLC 648 · 22:49
    MediumGoogle · Microsoft · +2 more companiesLeetCode ↗ (opens in a new tab)
  8. Find the Length of the Longest Common PrefixLC 3043 · 37:07
    MediumGoogle · Amazon · +15 more companiesLeetCode ↗ (opens in a new tab)
  9. Sum of Prefix Scores of StringsLC 2416 · 31:21
    HardGoogle · AmazonLeetCode ↗ (opens in a new tab)
  10. Count Prefix and Suffix Pairs ILC 3042 · 42:53
    EasyGoogle · Amazon · +4 more companiesLeetCode ↗ (opens in a new tab)
  11. Counting Words With a Given PrefixLC 2185 · 31:25
    EasyGoogle · Meta · +2 more companiesLeetCode ↗ (opens in a new tab)

  12. Word Search with Trie

    0 of 1 passed
  13. Word Search IILC 212 · 44:37
    HardGoogle · Amazon · +17 more companiesLeetCode ↗ (opens in a new tab)

  14. Bitwise Trie (Max XOR)

    0 of 1 passed
  15. Maximum XOR of Two Numbers in an ArrayLC 421 · 56:12
    MediumGoogle · Amazon · +3 more companiesLeetCode ↗ (opens in a new tab)

All 10 stations in order

  1. 1.Word Search II (LeetCode 212)
  2. 2.Implement Trie (Prefix Tree) (LeetCode 208)
  3. 3.Maximum XOR of Two Numbers in an Array (LeetCode 421)
  4. 4.Longest Common Suffix Queries (LeetCode 3093)
  5. 5.Replace Words (LeetCode 648)
  6. 6.Find the Length of the Longest Common Prefix (LeetCode 3043)
  7. 7.Sum of Prefix Scores of Strings (LeetCode 2416)
  8. 8.Count Prefix and Suffix Pairs I (LeetCode 3042)
  9. 9.Counting Words With a Given Prefix (LeetCode 2185)
  10. 10.Delete Duplicate Folders in System (LeetCode 1948)