Trying to Understand KMP Algorithm

I am trying to understand KMP (Knuth-Morris-Pratt) algorithm for pattern matching. I read some articles online but having trouble to understand the logic. I want something which is as simple as possible, no mathematical terms. I read from website like GeeksForGeeks & TutorialsPoint etc. Still I am having doubts. If someone can help me with alternative articles I will be thankful. I also see lot of tutorials added in DigitalOcean. Is there anything related to text searching algorithm?

Submit an answer

This textbox defaults to using Markdown to format your answer.

You can type !ref in this text area to quickly search our full set of tutorials, documentation & marketplace offerings and insert the link!

Sign In or Sign Up to Answer

These answers are provided by our Community. If you find them useful, show some love by clicking the heart. If you run into issues leave a comment, or add your own answer to help others.

Want to learn more? Join the DigitalOcean Community!

Join our DigitalOcean community of over a million developers for free! Get help and share knowledge in Q&A, subscribe to topics of interest, and get courses and tools that will help you grow as a developer and scale your project or business.

I don’t think DigitalOcean is a good place to ask questions about algorithm. You could have tried your luck in StackOverFlow. There are many resources on KMP algorithm (written + video). KMP is pretty advanced topic on pattern searching. So you need to try these resources one by one & see which one clicks for you. If you are struggling about KMP concept, you can check . This article has some good examples. You can follow them. You should be able to understand the concept & time complexity of the algorithm.