10.0 Tries and String Matching

Tries and String Matching

Prefix trees and search algorithms used in autocomplete, substring search, and pattern parsing.

1.0 Trie Basics

1. Insert/search/delete words
2. Prefix search
3. Auto-suggestion systems

2.0 Compressed & Suffix Tries

1. Radix trie
2. Suffix trie
3. Suffix tree intro

3.0 String Matching Algorithms

1. KMP (prefix table)
2. Rabin-Karp (hash rolling)
3. Z-algorithm

4.0 Word Dictionary & Variants

1. Word search in board (DFS + Trie)
2. Word break I/II
3. Replace words in sentence

5.0 Regex and Wildcard Parsing

1. Regex match with . and *
2. Wildcard ? and * patterns
3. Backtracking + memoization combo