Data Structures and Algorithms · Strings

String matching algorithms

Finding all occurrences of a pattern inside a larger text faster than checking every position.

Also known as: KMP, Rabin-Karp, pattern search.

Start a lesson on String matching algorithms

Learn first

• Arrays: A fixed-layout, contiguous block of memory where any index is reached in constant time.

Related topics

• Hash tables: Mapping keys to array slots via a hash function for near-constant-time lookup.
• Tries: A tree where each path from the root spells out a prefix, built for fast string lookup.