longest_suffix.pl

#!/usr/bin/perl

my @in = qw(asfalt asfaltu asfalcie);

sub longest_suffix {
    my $list = shift;
    my $first = shift(@{$list});

    for my $second(@in) {
        my @a = split(//, $first);
        my @b = split(//, $second);
        my $len = ($#a < $#b) ? $#a : $#b;

        my $common = '';
        for (my $i = 0; $i <= $len; $i++) {
            if($a[$i] eq $b[$i]) {
                $common .= $a[$i];
            }
        }
        $first = $common;
    }
    $first;
}

print longest_suffix(\@in);