String Algorithms

Pattern matching (KMP, Rabin-Karp), edit distance, tries for prefix search, palindrome techniques.

Why we need this / what value this brings

String problems are common in interviews and also map directly to real tooling — the parent README already flags Myers-diff/LCS as the real mechanism behind command-output diffing before it reaches an LLM.

When to use this

Substring search at scale (KMP/Rabin-Karp beat naive O(nm)), fuzzy/edit-distance matching, autocomplete (tries).

How to use or implement this

Know naive string matching's O(nm) cost before reaching for KMP/Rabin-Karp — only worth the added complexity once the naive approach is a measured bottleneck.

Research questions

• Follow up on the parent README's Myers-diff research question here directly — this is its natural home now that the subtopic exists.

---

Empty folder — drop notes, links, and findings here as you research.