-
Notifications
You must be signed in to change notification settings - Fork 19.9k
Adding Manacher's algorithm to Java/strings. #2015
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.
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
Conversation
Largest range
Revert "Largest range"
Travis tests have failedHey @AzadN, TravisBuddy Request Identifier: 8beba410-1ed7-11eb-b069-4b84fe73ac29 |
This pull request has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions. |
Please reopen this pull request once you commit the changes requested or make improvements on the code. If this is not the case and you need some help, feel free to seek help from our Gitter or ping one of the reviewers. Thank you for your contributions! |
@shellhub this is another code from the earlier mentioned large PR #1990. This is an implementation of Manacher's Algorithm to find the longest substring without duplication. The logic has been taken from Wikipedia.
@Kush1101 could you too review this?
Describe your change:
References
Checklist:
Fixes: #{$ISSUE_NO}
.