Add polettix's solution to challenge-217

6 files changed, 47 insertions, 0 deletions

diff --git a/challenge-217/polettix/blog.txt b/challenge-217/polettix/blog.txt
new file mode 100644
index 0000000000..e2064fa36a
--- /dev/null
+++ b/challenge-217/polettix/blog.txt
@@ -0,0 +1 @@
+https://etoobusy.polettix.it/2023/05/18/pwc217-sorted-matrix/
diff --git a/challenge-217/polettix/blog1.txt b/challenge-217/polettix/blog1.txt
new file mode 100644
index 0000000000..ca9b400916
--- /dev/null
+++ b/challenge-217/polettix/blog1.txt
@@ -0,0 +1 @@
+https://etoobusy.polettix.it/2023/05/19/pwc217-max-number/
diff --git a/challenge-217/polettix/perl/ch-1.pl b/challenge-217/polettix/perl/ch-1.pl
new file mode 100644
index 0000000000..96cd802876
--- /dev/null
+++ b/challenge-217/polettix/perl/ch-1.pl
@@ -0,0 +1,21 @@
+#!/usr/bin/env perl
+use v5.24;
+use warnings;
+
+my @matrix = map { [ split m{\s*,\s*}mxs ] } @ARGV;
+say third_smallest(@matrix);
+
+sub third_smallest {
+   my @three_smallest;
+   for my $row (@_) {
+      for my $item ($row->@*) {
+         my $idx = scalar(@three_smallest);
+         --$idx while $idx > 0 && $three_smallest[$idx - 1] > $item;
+         next if $idx > 2;
+         splice(@three_smallest, $idx, 0, $item);
+         pop(@three_smallest) while @three_smallest > 3;
+
+      }
+   }
+   return $three_smallest[-1];
+}
diff --git a/challenge-217/polettix/perl/ch-2.pl b/challenge-217/polettix/perl/ch-2.pl
new file mode 100644
index 0000000000..81e71dcbad
--- /dev/null
+++ b/challenge-217/polettix/perl/ch-2.pl
@@ -0,0 +1,2 @@
+#!/usr/bin/env perl
+print join('', sort { ($b . $a) <=> ($a . $b) } @ARGV), "\n";
diff --git a/challenge-217/polettix/raku/ch-1.raku b/challenge-217/polettix/raku/ch-1.raku
new file mode 100644
index 0000000000..b96f565abe
--- /dev/null
+++ b/challenge-217/polettix/raku/ch-1.raku
@@ -0,0 +1,20 @@
+#!/usr/bin/env raku
+use v6;
+sub MAIN (*@rows) {
+   my @matrix = @rows.map({ [ .split(/ \s* \, \s* /)».Int ] });
+   put third-smallest(@matrix);
+}
+
+sub third-smallest (@matrix) {
+   my @three-smallest;
+   for @matrix -> $row {
+      for @$row -> $item {
+         my $idx = @three-smallest.elems;
+         --$idx while $idx > 0 && @three-smallest[$idx - 1] > $item;
+         next if $idx > 2;
+         @three-smallest.splice($idx, 0, $item);
+         @three-smallest.pop while @three-smallest > 3;
+      }
+   }
+   return @three-smallest[*-1];
+}
diff --git a/challenge-217/polettix/raku/ch-2.raku b/challenge-217/polettix/raku/ch-2.raku
new file mode 100644
index 0000000000..2b34c40492
--- /dev/null
+++ b/challenge-217/polettix/raku/ch-2.raku
@@ -0,0 +1,2 @@
+#!/usr/bin/env raku
+@*ARGS.sort({"$^b$^a".Int <=> "$^a$^b".Int}).join('').put;