Longest palindromic substrings: Difference between revisions

Line 445:

=={{header|Raku}}==

This version regularizes (ignores) case and ignores non ~~alphabetic~~ 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.

This version regularizes (ignores) case and ignores non alphanumeric 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.

<lang perl6>my @chars = q:to/END/ .lc.comb: /\w/;

Line 508:

}

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

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

<pre>doninemeninterpretninemeninod godarednuggetafateggunderadog~~</pre>~~

<pre>doninemeninterpretninemeninod godarednuggetafateggunderadog

gohangasalamiimalasagnahog

arwontloversrevoltnowra

imanamregalagermanami mayamoodybabydoomayam ootnolemonsnomelontoo oozyratinasanitaryzoo

ratsliveonnoevilstar</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> We~~ get:

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] we get:

<pre>9475082805749