Challenge 111 Solutions (Raku)

2 files changed, 27 insertions, 0 deletions

diff --git a/challenge-111/mark-anderson/raku/ch-1.raku b/challenge-111/mark-anderson/raku/ch-1.raku
new file mode 100644
index 0000000000..faddc1f411
--- /dev/null
+++ b/challenge-111/mark-anderson/raku/ch-1.raku
@@ -0,0 +1,18 @@
+#!/usr/bin/env raku
+
+use Test;
+plan 2;
+
+my @m = [  1,  2,  3,  5,  7 ],
+        [  9, 11, 15, 19, 20 ],
+        [ 23, 24, 25, 29, 31 ],
+        [ 32, 33, 39, 40, 42 ],
+        [ 45, 47, 48, 49, 50 ];
+
+is search-matrix(35, @m), 0, "Example 1";
+is search-matrix(39, @m), 1, "Example 2";
+
+sub search-matrix($n, @m)
+{
+    +($n ∈ first { .tail ≥ $n }, @m) 
+}
diff --git a/challenge-111/mark-anderson/raku/ch-2.raku b/challenge-111/mark-anderson/raku/ch-2.raku
new file mode 100644
index 0000000000..0256bcc994
--- /dev/null
+++ b/challenge-111/mark-anderson/raku/ch-2.raku
@@ -0,0 +1,9 @@
+#!/usr/bin/env raku
+
+# [Adelops alloquy beefily begorry billowy egilops]
+
+say "/usr/share/dict/words".IO.lines
+
+.hyper(batch => 10_000, degree => $*KERNEL.cpu-cores)
+
+.grep({ $_ eq .comb.collate.join }).classify({ .chars }).max.value;