Add Ben Davies' Raku solutions for challenge 50

3 files changed, 27 insertions, 0 deletions

diff --git a/challenge-050/ben-davies/README.md b/challenge-050/ben-davies/README.md
new file mode 100644
index 0000000000..77158344c9
--- /dev/null
+++ b/challenge-050/ben-davies/README.md
@@ -0,0 +1 @@
+Solution by Ben Davies
diff --git a/challenge-050/ben-davies/raku/ch-1.raku b/challenge-050/ben-davies/raku/ch-1.raku
new file mode 100644
index 0000000000..42c4045774
--- /dev/null
+++ b/challenge-050/ben-davies/raku/ch-1.raku
@@ -0,0 +1,16 @@
+use v6.d;
+unit sub MAIN() {
+    my constant @INTERVALS = ((2, 7), (3, 9), (10, 12), (15, 19), (18, 22));
+    # - Flatten @INTERVALS:
+    #   => (2, 7, 3, 9, 10, 12, 15, 19, 18, 22)
+    # - Take the first number:
+    #   => (2)
+    # - Take any pairs of numbers in between the first and last ones where the
+    #   first is lesser than the second (those that aren't overlap):
+    #   => (2, 9, 10, 12, 15)
+    # - Take the last number:
+    #   => (2, 9, 10, 12, 15, 22)
+    # - Pair the numbers back together:
+    #   => ((2, 9), (10, 12), (15, 22))
+    say (.[0], |.[0^..^*-1].grep(* < *).flat, .[*-1]).rotor(2) given @INTERVALS.flat;
+}
diff --git a/challenge-050/ben-davies/raku/ch-2.raku b/challenge-050/ben-davies/raku/ch-2.raku
new file mode 100644
index 0000000000..5ee23a2899
--- /dev/null
+++ b/challenge-050/ben-davies/raku/ch-2.raku
@@ -0,0 +1,10 @@
+use v6.d;
+unit sub MAIN() {
+    # Two or more Noble Integers can exist in a list if they're equal 😉:
+    # my Int:D @L = (2, 2, 6, 1, 3);
+    my Int:D @L = (2, 6, 1, 3);
+    # Grep for all integers in @L where the list of integers in @L greater than
+    # said integer is equal in length to said integer:
+    say '<== ', @L;
+    say '==> ', @L.grep({ @L.grep(* > $_) == $_ });
+}