KMP Algorithm for Pattern Searching

[manastole03]

🚀 Feature

An easy to implement an algorithm (KMP Algorithm) that finds the pattern in a given text.

Have you read the Contribution Guidelines?

Yes

Pitch

Given a text text[] and a pattern[], write a function search(char pattern[], char text[]) that prints all occurrences of pattern[] in text[]. Example : text[] = "My Name is Manas" pat[] = "Manas" Solution : Pattern found at index 12

[manastole03]

Please assign this issue to me :) 👍 @PaulEvans8669 @cr33dx @Corentin-Leffy @beardedasianlad

[shubhig226]

@manastole03 I can do this using java