KMP algorithm.

$1.$ Create lookup table $($lps$)$;

$2.$ specify the number of iterations $($windows moves$)$ to find all matches with the pattern;

$3.$ submit the code that: specify the index $($positions$)$ of the pattern from the given text.

T: AABAACAADAABAABA

P: AABA

$-----------------$

T$2$: ABCABCBACEBBACEBACEABCEBACABCABCABCBECAB$-$EUAB$\backslash -$ABCABCAEBC

P$2$: ABCABCA

$-----------------$

T$3$: AAAAAAAAAB

P$3$: AAAAA