0 of 12 Parts Published
Main Parts
The core 12-part path: string models and encodings, string DP patterns, exact matching, tries and multi-pattern search, suffix arrays/trees/automata and compressed indexes, palindromes and combinatorics on words, approximate matching, automata/regex/parsing, compression, algebraic and randomized methods, then algorithm engineering.
Part 1
String Models, Encoding & Core Operations
Alphabets, prefixes and borders, Unicode encodings, and the representations every later algorithm builds on.
Read Article →Part 2
Core Problem-Solving Patterns & String DP
Frequency tables, sliding windows, two-pointer techniques, and dynamic programming patterns for string problems.
Read Article →Part 3
Exact Pattern Matching
From naive comparison to KMP, Z, rolling hashes, Boyer-Moore, Two-Way, and bit-parallel matching
Read Article →Part 4
Dictionaries, Tries & Multiple-Pattern Search
Prefix dictionaries, compressed tries, automata, and Aho-Corasick multi-pattern matching
Read Article →Part 5
Suffix Arrays, LCP & Range Queries
Suffix sorting, linear-time LCP construction, RMQ, and substring analytics
Read Article →Part 6
Suffix Trees, Suffix Automata & Compressed Indexes
Linear-size substring indexes, online automata, BWT, and the FM-index
Read Article →Part 7
Palindromes, Periodicity & Combinatorics on Words
Palindrome radii, Eertrees, borders, runs, Lyndon words, rotations, and repetitive structure
Read Article →Part 8
Edit Distance, Alignment & Approximate Matching
Edit metrics, LCS acceleration, global/local alignment, filters, and metric indexes
Read Article →Part 9
Automata, Regular Expressions & Parsing
Finite automata, regex engines, context-free grammars, parsing families, and lexical processing
Read Article →Part 10
String Compression
Entropy coding, dictionary compression, BWT pipelines, and searchable compressed representations
Read Article →Part 11
Algebraic, Randomized, Dynamic & Multidimensional Methods
FFT matching, fingerprints, editable indexes, streaming strings, grids, trees, and specialized alphabets
Read Article →Part 12
Engineering, Selection & Production Correctness
Testing, adversarial safety, performance engineering, Unicode contracts, and workload-driven selection
Read Article →0 of 14 Deep Dives Published
Deep Dives
Focused technique write-ups published alongside the part they extend: KMP's prefix function, the Z-algorithm, rolling hashes, Boyer-Moore, Aho-Corasick, suffix array/tree/automaton construction, FM-index backward search, Manacher vs. Eertree, Myers bit-vector edit distance, regex engine safety, BWT compression, and FFT-based wildcard matching.
Deep Dive
Prefix Function, Borders & KMP
Failure transitions and border chains from first principles
Read Article →Deep Dive
Rolling Hashes Without Hand-Waving
Fast substring fingerprints with explicit collision guarantees
Read Article →Deep Dive
Z-Algorithm and Its Invariants
Maintaining the rightmost prefix-match interval in linear time
Read Article →Deep Dive
Boyer-Moore Good-Suffix Preprocessing
Deriving strong suffix shifts and matched-prefix fallbacks
Read Article →Deep Dive
Aho-Corasick Failure Automaton
Failure links, output links, and output-sensitive multi-pattern search
Read Article →Deep Dive
Suffix Array Construction: Doubling to SA-IS
Rank doubling, induced sorting, and linear-time suffix ordering
Read Article →Deep Dive
Ukkonen's Suffix Tree Construction
Active points, suffix links, implicit trees, and online linear-time construction
Read Article →Deep Dive
Suffix Automaton Clone States
Why cloning preserves transitions while splitting end-position classes
Read Article →Deep Dive
FM-Index Backward Search
LF-mapping, rank queries, and compressed pattern intervals
Read Article →Deep Dive
Manacher and Eertree Compared
All palindrome occurrences versus all distinct palindromes
Read Article →Deep Dive
Myers Bit-Vector Edit Distance
Packing an edit-distance frontier into machine-word operations
Read Article →Deep Dive
Regex Engines and Catastrophic Backtracking
Automata guarantees, backtracking explosions, and safer pattern design
Read Article →Deep Dive
BWT Compression Pipeline
From reversible permutation to move-to-front, runs, and entropy coding
Read Article →Deep Dive
FFT-Based Wildcard Matching
Convolution identities for wildcard and mismatch detection
Read Article →0 of 5 Projects Published
Projects & Capstone
Four progressively harder hands-on builds -- a pattern-matching workbench, a multi-pattern log scanner, a text similarity/diff toolkit, and a compressed corpus search engine -- followed by a Unicode-aware document search system capstone.
Capstone
Pattern-Matching Workbench
A unified laboratory for exact matching algorithms and their preprocessing tables
Read Article →Capstone
Multi-Pattern Log Scanner
Streaming Aho-Corasick search with tagged dictionaries and boundary-safe ingestion
Read Article →Capstone
Text Similarity & Diff Toolkit
LCS, edit scripts, alignment, and approximate lookup in one comparison suite
Read Article →Capstone
Compressed Corpus Search
Suffix arrays, BWT, FM-index search, occurrence location, and compression trade-offs
Read Article →Capstone
Unicode-Aware Document Search System
Exact, approximate, prefix, compressed, and dynamic search with explicit text semantics
Read Article →