Added KMP Algorithm In Java #25
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
IamBisrutPyne
approved these changes
Oct 6, 2025
There was a problem hiding this comment.
Hey @coddingjatin 👋
This is a fantastic contribution.
The KMP algorithm is a vital algorithm in CS, and a perfect fit for the Algorithms folder.
Comments
It is generally better to wrap Scanner in the try-with-resources block for resource safety.
Thank you for your contribution. Happy Hacking! ✨
IamBisrutPyne
added
enhancement
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This Java program demonstrates the Knuth–Morris–Pratt (KMP) String Matching Algorithm, an efficient technique for finding all occurrences of a substring (pattern) within a main string (text). Unlike the naive search method, KMP avoids rechecking previously matched characters by using a preprocessed Longest Prefix Suffix (LPS) array. This optimization allows it to achieve a linear time complexity of O(n + m), making it ideal for applications in text processing, compilers, and data search operations. The program takes user input for both the text and the pattern and displays all the starting indices where the pattern is found.