Merge pull request #8077 from PerlBoy1967/branch-for-challenge-217

w217 - Task 1 & 2

2 files changed, 91 insertions, 0 deletions

diff --git a/challenge-217/perlboy1967/perl/ch1.pl b/challenge-217/perlboy1967/perl/ch1.pl
new file mode 100755
index 0000000000..5de8809b9b
--- /dev/null
+++ b/challenge-217/perlboy1967/perl/ch1.pl
@@ -0,0 +1,56 @@
+#!/bin/perl
+
+=pod
+
+The Weekly Challenge - 217
+- https://theweeklychallenge.org/blog/perl-weekly-challenge-217
+
+Author: Niels 'PerlBoy' van Dijke
+
+Task 1: Sorted Matrix
+Submitted by: Mohammad S Anwar
+
+You are given a n x n matrix where n >= 2.
+
+Write a script to find 3rd smallest element in the sorted matrix.
+
+=cut
+
+use v5.16;
+
+use common::sense;
+
+use List::MoreUtils qw(arrayify);
+
+use Test::More;
+
+sub nthElement ($\@) {
+  (sort{$a<=>$b}arrayify($_[1]))[$_[0]-1];
+}
+
+is(nthElement(3,@{[
+                   [3,1,2],
+                   [5,2,4],
+                   [0,1,3],
+                ]}),1);
+is(nthElement(3,@{[
+                   [2,1],
+                   [4,5],
+                 ]}),4);
+is(nthElement(3,@{[
+                   [1,0,3],
+                   [0,0,0],
+                   [1,2,1],
+                 ]}),0);
+is(nthElement(4,@{[
+                   [3,1,2],
+                   [5,2,4],
+                   [0,1,3],
+                 ]}),2);
+is(nthElement(12,@{[
+                    [[0,1,2],[3,4,5],[6,7,8]],
+                    [[0,0,0],[0,0,0],[0,0,0]],
+                    [[8,7,6],[5,4,3],[2,1,0]],
+                 ]}),1);
+
+done_testing;
diff --git a/challenge-217/perlboy1967/perl/ch2.pl b/challenge-217/perlboy1967/perl/ch2.pl
new file mode 100755
index 0000000000..60d238fdf7
--- /dev/null
+++ b/challenge-217/perlboy1967/perl/ch2.pl
@@ -0,0 +1,35 @@
+#!/bin/perl
+
+=pod
+
+The Weekly Challenge - 217
+- https://theweeklychallenge.org/blog/perl-weekly-challenge-217
+
+Author: Niels 'PerlBoy' van Dijke
+
+Task 2: Max Number
+Submitted by: Mohammad S Anwar
+
+You are given a list of positive integers.
+
+Write a script to concatenate the integers to form the highest possible value.
+
+=cut
+
+use v5.16;
+
+use common::sense;
+
+use Test::More;
+
+sub maxNumber (@) {
+  join('',sort{$b.$a<=>$a.$b}@_);
+}
+
+is(maxNumber(1,23),231);
+is(maxNumber(10,3,2),3210);
+is(maxNumber(31,2,4,10),431210);
+is(maxNumber(5,11,4,1,2),542111);
+is(maxNumber(1,10),110);
+
+done_testing;