Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Knuth-Morris-Pratt (KMP) Algorithm #2002

Closed
4 of 5 tasks
T-Fathima opened this issue Nov 10, 2024 · 0 comments
Closed
4 of 5 tasks

Knuth-Morris-Pratt (KMP) Algorithm #2002

T-Fathima opened this issue Nov 10, 2024 · 0 comments
Labels
enhancement New feature or request in-review Indicates that the pull request or issue is currently under review.

Comments

@T-Fathima
Copy link
Contributor

Idea Title

Implement Knuth-Morris-Pratt (KMP) String Matching Algorithm

Idea Description

This issue is to implement the Knuth-Morris-Pratt (KMP) algorithm, which improves the efficiency of the naive string matching algorithm by preprocessing the pattern. It builds a longest prefix-suffix (LPS) array to avoid redundant comparisons, allowing for faster pattern matching. The KMP algorithm is optimal for searching a single pattern within a text.

Potential Benefits

  • Improves user experience
  • Enhances learning
  • Adds a new feature
  • Improves code quality
  • Other

Implementation Suggestions (Optional)

No response
@T-Fathima T-Fathima added the enhancement New feature or request label Nov 10, 2024
@github-actions github-actions bot added the in-review Indicates that the pull request or issue is currently under review. label Nov 10, 2024
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
enhancement New feature or request in-review Indicates that the pull request or issue is currently under review.
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@ajay-dhangar @T-Fathima