HF RL Explorer

KMP Prefix Table Implementation

KMP Prefix Table Implementation: a task in Terminal-Lego-15k (Harbor dataset). The Knuth-Morris-Pratt (KMP) algorithm is an efficient string matching algorithm that uses a prefix table (also called failure function or partial match table) to avoid unnecessary character comparisons.

The task

The Knuth-Morris-Pratt (KMP) algorithm is an efficient string matching algorithm that uses a **prefix table** (also called failure function or partial match table) to avoid unnecessary character comparisons.

Part of PrimeIntellect/Terminal-Lego-15k.