Merge pull request #12583 from wanderdoc/master

PWC 336 (wanderdoc)

2 files changed, 212 insertions, 0 deletions

diff --git a/challenge-336/wanderdoc/perl/ch-1.pl b/challenge-336/wanderdoc/perl/ch-1.pl
new file mode 100644
index 0000000000..da7290a4ce
--- /dev/null
+++ b/challenge-336/wanderdoc/perl/ch-1.pl
@@ -0,0 +1,75 @@
+#!perl
+use strict;
+use warnings FATAL => qw(all);
+
+=prompt
+You are given an array of integers.
+Write a script to return true if the given array can be divided into one or more groups of same size such that each group has two or more members having same value.
+
+Example 1
+
+Input: @ints = (1,1,2,2,2,2)
+Output: true
+
+Groups: (1,1), (2,2), (2,2)
+
+
+Example 2
+
+Input: @ints = (1,1,1,2,2,2,3,3)
+Output: false
+
+Groups: (1,1,1), (2,2,2), (3,3)
+
+
+Example 3
+
+Input: @ints = (5,5,5,5,5,5,7,7,7,7,7,7)
+Output: true
+
+Groups: (5,5,5,5,5,5), (7,7,7,7,7,7)
+
+
+Example 4
+
+Input: @ints = (1,2,3,4)
+Output: false
+
+
+Example 5
+
+Input: @ints = (8,8,9,9,10,10,11,11)
+Output: true
+
+Groups: (8,8), (9,9), (10,10), (11,11)
+=cut
+
+
+
+
+use List::Util qw(min first);
+use constant { true => 1, false => 0 };
+
+use Test2::V0 -no_srand => 1;
+
+is(equal_group(1,1,2,2,2,2), true, 'Example 1');
+is(equal_group(1,1,1,2,2,2,3,3), false, 'Example 2');
+is(equal_group(5,5,5,5,5,5,7,7,7,7,7,7), true, 'Example 3');
+is(equal_group(1,2,3,4), false, 'Example 4');
+is(equal_group(8,8,9,9,10,10,11,11), true, 'Example 5');
+done_testing();
+
+
+sub equal_group
+{
+     my @arr = @_;
+     @arr = sort {$a <=> $b} @arr;
+     my %freq;
+     $freq{$_}++ for @arr;
+     my @slots = values %freq;
+     my $max_size = min(@slots);
+     return false if $max_size < 2;
+     return false if defined first { $_ % $max_size != 0 } @slots;
+     return true;
+     
+}
diff --git a/challenge-336/wanderdoc/perl/ch-2.pl b/challenge-336/wanderdoc/perl/ch-2.pl
new file mode 100644
index 0000000000..ebdd40d019
--- /dev/null
+++ b/challenge-336/wanderdoc/perl/ch-2.pl
@@ -0,0 +1,137 @@
+#!perl
+use strict;
+use warnings FATAL => qw(all);
+
+=prompt
+You are given an array of scores by a team.
+Write a script to find the total score of the given team. The score can be any integer, +, C or D. The + adds the sum of previous two scores. The score C invalidates the previous score. The score D will double the previous score.
+
+Example 1
+
+Input: @scores = ("5","2","C","D","+")
+Output: 30
+
+Round 1: 5
+Round 2: 5 + 2
+Round 3: 5 (invalidate the previous score 2)
+Round 4: 5 + 10 (double the previous score 5)
+Round 5: 5 + 10 + 15 (sum of previous two scores)
+
+Total Scores: 30
+
+
+Example 2
+
+Input: @scores = ("5","-2","4","C","D","9","+","+")
+Output: 27
+
+Round 1: 5
+Round 2: 5 + (-2)
+Round 3: 5 + (-2) + 4
+Round 4: 5 + (-2) (invalidate the previous score 4)
+Round 5: 5 + (-2) + (-4) (double the previous score -2)
+Round 6: 5 + (-2) + (-4) + 9
+Round 7: 5 + (-2) + (-4) + 9 + 5 (sum of previous two scores)
+Round 8: 5 + (-2) + (-4) + 9 + 5 + 14 (sum of previous two scores)
+
+Total Scores: 27
+
+
+Example 3
+
+Input: @scores = ("7","D","D","C","+","3")
+Output: 45
+
+Round 1: 7
+Round 2: 7 + 14 (double the previous score 7)
+Round 3: 7 + 14 + 28 (double the previous score 14)
+Round 4: 7 + 14 (invalidate the previous score 28)
+Round 5: 7 + 14 + 21 (sum of previous two scores)
+Round 6: 7 + 14 + 21 + 3
+
+Total Scores: 45
+
+
+Example 4
+
+Input: @scores = ("-5","-10","+","D","C","+")
+Output: -55
+
+Round 1: (-5)
+Round 2: (-5) + (-10)
+Round 3: (-5) + (-10) + (-15) (sum of previous two scores)
+Round 4: (-5) + (-10) + (-15) + (-30) (double the previous score -15)
+Round 5: (-5) + (-10) + (-15) (invalidate the previous score -30)
+Round 6: (-5) + (-10) + (-15) + (-25) (sum of previous two scores)
+
+Total Scores: -55
+
+
+Example 5
+
+Input: @scores = ("3","6","+","D","C","8","+","D","-2","C","+")
+Output: 128
+
+Round  1: 3
+Round  2: 3 + 6
+Round  3: 3 + 6 + 9 (sum of previous two scores)
+Round  4: 3 + 6 + 9 + 18 (double the previous score 9)
+Round  5: 3 + 6 + 9 (invalidate the previous score 18)
+Round  6: 3 + 6 + 9 + 8
+Round  7: 3 + 6 + 9 + 8 + 17 (sum of previous two scores)
+Round  8: 3 + 6 + 9 + 8 + 17 + 34 (double the previous score 17)
+Round  9: 3 + 6 + 9 + 8 + 17 + 34 + (-2)
+Round 10: 3 + 6 + 9 + 8 + 17 + 34 (invalidate the previous score -2)
+Round 11: 3 + 6 + 9 + 8 + 17 + 34 + 51 (sum of previous two scores)
+
+Total Scores: 128
+=cut
+
+
+
+
+
+
+use List::Util qw(sum);
+
+use Test2::V0 -no_srand => 1;
+is(final_score("5","2","C","D","+"), 30, 'Example 1');
+is(final_score("5","-2","4","C","D","9","+","+"), 27, 'Example 2');
+is(final_score("7","D","D","C","+","3"), 45, 'Example 3');
+is(final_score("-5","-10","+","D","C","+"), -55, 'Example 4');
+is(final_score("3","6","+","D","C","8","+","D","-2","C","+"), 128, 'Example 5');
+done_testing();
+
+sub final_score
+{
+     my @arr = @_;
+     my @cache;
+     for my $elm ( @arr )
+     {
+          if ( $elm =~ /\-?\d/ )
+          {
+               push @cache, $elm;
+          }
+          elsif ( $elm eq '+' )
+          {
+               if ( scalar @cache > 1 )
+               {
+                    push @cache, sum (@cache[$#cache-1, $#cache]);
+               }
+               elsif ( scalar @cache == 1 )
+               {
+                    # not in the challenge, just a guess:
+                    push @cache, $cache[0];
+               }
+          }
+          elsif ( $elm eq 'C' )
+          {
+               pop @cache;
+          }
+          elsif ( $elm eq 'D' )
+          {
+               push @cache, sum (@cache[$#cache, $#cache]);
+          }
+     }
+     return sum(@cache);
+}