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

Maximal Boundaries—Knuth–Morris–Pratt #61

Open
Rahul555-droid opened this issue Jan 8, 2021 · 3 comments
Open

Maximal Boundaries—Knuth–Morris–Pratt #61

Rahul555-droid opened this issue Jan 8, 2021 · 3 comments
Labels
SWOC SWoC20

Comments

@Rahul555-droid
Copy link

Input: abracadabra
Output: abra abra

An important classic problem on character strings is the detection of occurrences
of a pattern t in a string s. The Knuth–Morris–Pratt algorithm solves this problem
in optimal linear time O(|t| + |s|)

I would want to work on this issue for SWOC and would want to implement this in python.
@Rahul555-droid
Copy link
Author

I would want to work on this issue for SWOC and would want to implement this in python.

Please assign me this!!

@Abhijit2505
Copy link
Member

@Rahul555-droid please get started

@Abhijit2505 Abhijit2505 reopened this Jan 17, 2021
@Rahul555-droid
Copy link
Author

Okay thanks! will do.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
SWOC SWoC20
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@Abhijit2505 @Rahul555-droid