feat: Add Manacher's Algorithm for finding the longest palindromic substring #587
Conversation
This file contains 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
…bstring - Implemented `manacher` function in `pydatastructs.strings.algorithms`. - Added unit tests for `manacher` in `test_algorithms.py`. - Updated `__all__` list to include `manacher` for public API access. Manacher's Algorithm provides an efficient O(n) solution for finding the longest palindromic substring in a given string. This addition enhances the string processing capabilities of the library.
|
@Kishan-Ved Pls review this PR |
Kishan-Ved
suggested changes
Mar 3, 2025
|
@czgdp1807 It looks like the windows CI is failing from many recent PRs. |
|
@Kishan-Ved Make the changes but still window CI still failed. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
Description
This PR adds Manacher's Algorithm to the
pydatastructs.strings.algorithmsmodule. The algorithm efficiently finds the longest palindromic substring in a given string in O(n) time, wherenis the length of the string.Changes
manacherfunction inpydatastructs.strings.algorithms.manacherfunction intest_algorithms.py.__all__list to includemanacherfor public API access.Fixes: #586