From 2665e46991da2b6274dace29caa269b57884f036 Mon Sep 17 00:00:00 2001
From: wanderdoc <wanderdoc@googlemail.com>
Date: Sun, 11 Oct 2020 19:10:24 +0200
Subject: Solutions to challenge-081.

---
 challenge-081/wanderdoc/perl/ch-1.pl | 44 ++++++++++++++++++++++++++++
 challenge-081/wanderdoc/perl/ch-2.pl | 56 ++++++++++++++++++++++++++++++++++++
 2 files changed, 100 insertions(+)
 create mode 100644 challenge-081/wanderdoc/perl/ch-1.pl
 create mode 100644 challenge-081/wanderdoc/perl/ch-2.pl

diff --git a/challenge-081/wanderdoc/perl/ch-1.pl b/challenge-081/wanderdoc/perl/ch-1.pl
new file mode 100644
index 0000000000..fa13109f6e
--- /dev/null
+++ b/challenge-081/wanderdoc/perl/ch-1.pl
@@ -0,0 +1,44 @@
+#!perl
+use strict;
+use warnings FATAL => qw(all);
+
+=prompt
+You are given 2 strings, $A and $B. Write a script to find out common base string in $A and $B.
+A substring of a string $S is called base string if repeated concatenation of the substring results in the string.
+
+Example 1:
+Input: $A = "abcdabcd" $B = "abcdabcdabcdabcd" Output: ("abcd", "abcdabcd")
+Example 2: Input: $A = "aaa" $B = "aa" Output: ("a")
+=cut
+
+
+
+
+sub common_base
+{
+     my ($long, $short) = @_;
+     if ( length($long) < length($short) )
+     {
+          ($long, $short) = ($short, $long);
+     }
+     my @output;
+     my $len_short = length($short);
+
+     my $len_long = length($long);
+     for my $i ( reverse 1 .. $len_short )
+     {
+          my $fraction = $len_long / ($len_short - $i + 1);
+          next unless $fraction == int($fraction);
+          my $candidate = substr($short, $i - 1);
+          if ( $long eq $candidate x  $fraction )
+          {
+               push @output, $candidate;
+          }
+     }
+     return @output;
+
+
+}
+print "> ", join(' ', common_base('abcdabcd', 'abcdabcdabcdabcd')), $/;
+print "> ", join(' ', common_base('aa', 'aaa')), $/;
+print "> ", join(' ', common_base('abcdabcdabcdabcdabcdabcd', 'abcdabcdabcd')), $/;
\ No newline at end of file
diff --git a/challenge-081/wanderdoc/perl/ch-2.pl b/challenge-081/wanderdoc/perl/ch-2.pl
new file mode 100644
index 0000000000..e804e774b1
--- /dev/null
+++ b/challenge-081/wanderdoc/perl/ch-2.pl
@@ -0,0 +1,56 @@
+#!perl
+use strict;
+use warnings FATAL => qw(all);
+
+=prompt
+You are given file named input. Write a script to find the frequency of all the words.
+It should print the result as first column of each line should be the frequency of the the word followed by all the words of that frequency arranged in lexicographical order. Also sort the words in the ascending order of frequency.
+For the sake of this task, please ignore the following in the input file: . " ( ) , 's --
+=cut
+
+
+
+
+
+
+
+use Test::More;
+
+use FindBin qw($Bin);
+my $text = do { local $/; open my $in, "<", "$Bin/input.txt" or die "$!"; <$in> };
+$text =~ tr/."(),//ds;
+$text =~ s/\s+/ /g;
+$text =~ s/'s//g;
+
+$text =~ s/--/ /g;
+
+my $expected = <<EXPECTED;
+1 But City It Jet Juliet Latino New Romeo Side Story Their Then West York adaptation any anything at award-winning away become before begin best classic climactic coexist control dance do doesn't end ending escalates families feuding form former friend gains gangs goes happened hatred heartbreaking highway hoping in know love lovers meet meeting neither no one plan planning point romantic rumble run secret sends sister streets strikes terribly their two under understanding until violence warring what when where white whoever wins with wrong younger
+2 Bernardo Jets Riff Sharks The by it led tragedy
+3 Maria Tony a can of stop
+4 to
+9 and the
+EXPECTED
+
+
+
+my %count;
+$count{$_}++ for split(/\s/,$text);
+
+
+my %frequencies;
+for my $word ( keys %count )
+{
+
+     push @{$frequencies{$count{$word}}}, $word;
+}
+
+my $output;
+
+for my $num ( sort {$a <=> $b} keys %frequencies )
+{
+     $output .= join(' ', $num, sort { $a cmp $b } @{$frequencies{$num}}) . $/;
+}
+
+is($output, $expected, 'Matched');
+done_testing();
\ No newline at end of file
-- 
cgit