diff options
| -rw-r--r-- | challenge-245/mark-anderson/raku/ch-1.raku | 10 | ||||
| -rw-r--r-- | challenge-245/mark-anderson/raku/ch-2.raku | 68 |
2 files changed, 78 insertions, 0 deletions
diff --git a/challenge-245/mark-anderson/raku/ch-1.raku b/challenge-245/mark-anderson/raku/ch-1.raku new file mode 100644 index 0000000000..a36321d822 --- /dev/null +++ b/challenge-245/mark-anderson/raku/ch-1.raku @@ -0,0 +1,10 @@ +#!/usr/bin/env raku +use Test; + +is-deeply sort-lang(<perl c python>, [2,1,3]), <c perl python>; +is-deeply sort-lang(<c++ haskell java>, [1,3,2]), <c++ java haskell>; + +sub sort-lang(@languages, @popularities) +{ + .[@popularities] given [Any, |@languages] +} diff --git a/challenge-245/mark-anderson/raku/ch-2.raku b/challenge-245/mark-anderson/raku/ch-2.raku new file mode 100644 index 0000000000..5bbf9c5699 --- /dev/null +++ b/challenge-245/mark-anderson/raku/ch-2.raku @@ -0,0 +1,68 @@ +#!/usr/bin/env raku +use Test; + +# With help from https://www.geeksforgeeks.org/find-largest-multiple-3-array-digits-set-2-time-o1-space/ + +is largest-of-three(8,1,9), 981; +is largest-of-three(8,6,7,1,0), 8760; +is largest-of-three(1), Nil; + +sub largest-of-three(*@n) +{ + @n .= sort(-*); + + given @n.sum mod 3 + { + when 0 + { + return [~] @n + } + + when 1 + { + my $i = @n.first(* % 3 == 1, :k:end); + + with $i + { + @n.splice($i, 1); + return @n.head ?? [~] @n !! Nil + } + + else + { + return Nil + } + } + + when 2 + { + my $i = @n.first(* % 3 == 2, :k:end); + + with $i + { + @n.splice($i, 1); + return @n.head ?? [~] @n !! Nil + } + + else + { + for (^2) + { + my $i = @n.first(* % 3 == 1, :k:end); + + with $i + { + @n.splice($i, 1); + } + + else + { + return Nil + } + } + + return @n.head ?? [~] @n !! Nil + } + } + } +} |
