Manacher's Algorithm

[dlesnoff]

Manacher's Algorithm finds the longest palindromic factor (substring) in linear time in the length of the string input.

[SatinWukerORIG]

Well done! I like your raising error operations. Very clear comments, but just a few suggestions.

[dlesnoff]

@SatinWuker Is it working on your side?

[SatinWukerORIG]

@SatinWuker Is it working on your side?

It works really well 👍👍👍 thank you for your clear explanation and helpful comment on the file haha!

[dlesnoff]

As one may notice, I compute the indexes whenever I ask for the length and the string.
This might impact performance for very long strings. We may prefer to pass the indexes as parameters and determine the length or the string itself from this precomputed argument.
A better way to handle this would be to compute an object with None/Option[T] attributes, that we fill with precisely the information we want.

[dlesnoff]

@SatinWuker

It works really well +1+1+1 thank you for your clear explanation and helpful comment on the file haha!

Do you still require the variable name changes or would you like to approve the pull request?