Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery

Re: Finding longest palindrome from a string

by japhy (Canon)
on Aug 13, 2004 at 15:55 UTC ( #382732=note: print w/replies, xml ) Need Help??

in reply to Finding longest palindrome from a string

Because the golf isn't complete without an insanely short regex solution:
sub japhy { # 74 our$P="";pop=~m{(.+).?(??{reverse$1}) (?{length$P<length$&and$P=$&})^}xs;$P }
Update: inspired by ccn's array approach:
sub japhy { # 68 our@P="";pop=~m{(.+).?(??{reverse$ 1})(?{$P[length$&]=$&})^}xs;$P[-1] }
Jeff japhy Pinyan, P.L., P.M., P.O.D, X.S.: Perl, regex, and perl hacker
How can we ever be the sold short or the cheated, we who for every service have long ago been overpaid? ~~ Meister Eckhart

Replies are listed 'Best First'.
Re^2: Finding longest palindrome from a string
by Jasper (Chaplain) on Aug 17, 2004 at 08:45 UTC
    I forgot to mention that one of the golf competitions had a palindrome slant. Terje's perlgolf competitions site. There are some nice solutions there, as usual. Shorter than japhy's! :)

Log In?

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://382732]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (6)
As of 2021-09-21 11:20 GMT
Find Nodes?
    Voting Booth?

    No recent polls found