Java implementation of the Knuth-Morris-Pratt (KMP) algorithm for efficient pattern matching in sequences. Achieves O(n+m) time complexity through prefix-function computation, avoiding unnecessary character comparisons.