Skip to content

Instantly share code, notes, and snippets.

@hernan604
Created December 30, 2013 20:30
Show Gist options
  • Select an option

  • Save hernan604/8187676 to your computer and use it in GitHub Desktop.

Select an option

Save hernan604/8187676 to your computer and use it in GitHub Desktop.
#ABSTRACT: Calculates the longest palindrome in perl on a given text
use strict;
use warnings;
my $text = <<TXT;
pdsaj dspa jpdsaa sadsasd dsasad asd sajpod soja ospda opds osadpojsapjodsjpoasd pojasdjp odsaposadpojasdpoasdasd pjkoasd pjoasd pjoasd asd asd pojasd pojasd po aspodasd
dsaok jsdadas s a sads sadds dp wqej wfiwe
odsa sdasd dsasadsaadsasd pofwejp fpw pewf ew
kodas dsasda sad sa as sa asdads as asa sdasd
kosad a sada ssaaasd as adsasd asd asd asaaa a
koads ass d asdddad ada aa j ja jaj aha a ds adhsa
daskaskdodsasa[ a k dads[adskodsa dassad asd dsadsajk paja osa \
a doaa dsad aoa [dsa dd a[a [spd d[ adp[ a p[dakdpsa[pdas[ d
a ds fpeow fw few f ewfew[ feopwkf wek fkw pofkepow fpoewk ok eopfwkp
d aasd as d
sads a a sadd
iiiaaabbbcccdcccbbbaaaiii
sad racecar sa
sasaasd a
dasda sds
dsadsada sads
TXT
my $longest='';
map {
$longest = $_
if (
$_ ne ''
and $_ eq reverse $_
and length $_ > length $longest
)
} split /\s|\n|\r+/, $text;
warn "Longest palindromo: $longest";
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment