in reply to Finding longest palindrome from a string

sub jasper { $_ = pop; s/\s//sg; do { push@a,$1 if /((.*).?(??{reverse$2}))/i; } while s/.//; (sort{length($b)<=>length$a}@a)[0] }

edit: erg! I see that this is very similar to murugu's code.