Given two strings, one is a text string, txt and other is a pattern string, pat. The task is to print the indexes of all the occurences of pattern string in the text string. For printing, Starting ...

LPS array precomputes the length of the longest prefix. LPS precomputed for the pattern LPS allows to avoid unnecessary checks(pattern[0...i]). The KMP algorithm ...