Merge pull request #1349 from andemark/branch-for-challenge-050

Challenge 50 Solutions

2 files changed, 28 insertions, 0 deletions

diff --git a/challenge-050/mark-anderson/raku/ch-1.p6 b/challenge-050/mark-anderson/raku/ch-1.p6
new file mode 100644
index 0000000000..9dac34bf59
--- /dev/null
+++ b/challenge-050/mark-anderson/raku/ch-1.p6
@@ -0,0 +1,20 @@
+#!/usr/bin/env perl6
+
+my @array = ([2,7], [3,9], [10,12], [15,19], [18,22]);
+
+my @merged = @array.shift;
+
+while @array {
+    my @a = @array.shift.flat;
+    my @m = @merged.pop.flat;
+
+    if (@m[1] >= @a[0]) {
+        @merged.push([@m[0], @a[1]]);
+    }
+
+    else {
+       @merged.append(@m, @a);
+    }
+}
+
+say @merged.flat;
diff --git a/challenge-050/mark-anderson/raku/ch-2.p6 b/challenge-050/mark-anderson/raku/ch-2.p6
new file mode 100644
index 0000000000..678ecc2d99
--- /dev/null
+++ b/challenge-050/mark-anderson/raku/ch-2.p6
@@ -0,0 +1,8 @@
+#!/usr/bin/env perl6
+
+my @L = [2, 6, 1, 3];
+
+@L                                    ==>
+grep  { $_ < @L.elems }               ==> # skip numbers that aren't possible
+first { @L.grep(* > $_).elems == $_ } ==> # I'm trusting there can only be 1 
+say();