String Algorithms

A linear time string matching algorithm that finds all occurrences of a pattern in a text.

An efficient string searching algorithm that searches for multiple patterns simultaneously using an automaton.

A sorted array of all suffixes of a string, extremely useful for fast string queries.

A linear time algorithm to find the longest palindromic substring in a string.

A hashing technique used heavily in string matching algorithms like Rabin-Karp.

A guide to Manacher's Algorithm - finding the longest palindromic substring in O(n) time using palindromic symmetry.