Add Ben Davies' Raku solutions for challenge 135

A regex-y challenge.

2 files changed, 28 insertions, 0 deletions

diff --git a/challenge-135/ben-davies/raku/ch-1.raku b/challenge-135/ben-davies/raku/ch-1.raku
new file mode 100644
index 0000000000..6288c5f48b
--- /dev/null
+++ b/challenge-135/ben-davies/raku/ch-1.raku
@@ -0,0 +1,19 @@
+use v6;
+unit sub MAIN(
+    #|[Because negative integers get parsed like named parameters.]
+    IntStr:D :$n!
+) {
+    $n ~~ rx:r/ \d+ /; # Let's keep the Unicode.
+    given my $snip = $/.chars - 3 {
+        when * % 2 {
+            put 'even number of digits'
+        }
+        when * < 0 {
+            put 'too short';
+        }
+        default {
+            let $snip div= 2;
+            put m:r/ ^ [ . ** {$snip} ] <( . ** 3 )> [ . ** {$snip} ] $ / given $/;
+        }
+    }
+}
diff --git a/challenge-135/ben-davies/raku/ch-2.raku b/challenge-135/ben-davies/raku/ch-2.raku
new file mode 100644
index 0000000000..baf1c6d679
--- /dev/null
+++ b/challenge-135/ben-davies/raku/ch-2.raku
@@ -0,0 +1,9 @@
+use v6;
+unit sub MAIN(Str:D $sedol) {
+    my constant @digits  = |(<0>..<9>), |<B C D F G H J K L M N P Q R S T V W X Y Z>;
+    my constant @weights = <1 3 1 7 3 9 1>;
+    say +do
+        $sedol ~~ rx:r/ ^ <digit=@digits> ** 6 <check=[ 0..9 ]> $ / andthen
+        @<digit>.kv.map({ @weights[$^k] * :36(~$^v) }).sum andthen
+        (10 - $_ % 10) % 10 == $<check>;
+}