Longest palindromic substrings: Difference between revisions

This version regularizes (ignores) case and ignores non alphabeticalphanumeric characters. It is only concerned with finding the ''longest'' palindromic substrings so does not exhaustively find ''all possible'' palindromes. If a palindromic substring is found to be part of a longer palindrome, it is not captured separately. Showing the longest 5 palindromic substring groups.

.unique.sort.put for @cpfoa.grep( *.so ).tail(5).reverse;</lang>

<pre>doninemeninterpretninemeninod godarednuggetafateggunderadog</pre>

This isn't particularly optimised but isn't too shabby either. When run against the first million digits of pi: [http://www.eveandersson.com/pi/digits/1000000 http://www.eveandersson.com/pi/digits/1000000], and modifying the last line to return the top five longest palindrome groups <pre>.unique.sort.put for @cpfoa.grep( *.so ).tail(5).reverse;</pre> Wewe get: