diff options
| -rw-r--r-- | challenge-220/0rir/raku/ch-1.raku | 54 | ||||
| -rw-r--r-- | challenge-220/0rir/raku/ch-2.raku | 60 |
2 files changed, 114 insertions, 0 deletions
diff --git a/challenge-220/0rir/raku/ch-1.raku b/challenge-220/0rir/raku/ch-1.raku new file mode 100644 index 0000000000..875b5e07d4 --- /dev/null +++ b/challenge-220/0rir/raku/ch-1.raku @@ -0,0 +1,54 @@ +#!/usr/bin/env raku +# :vim ft=raku sw=4 expandtab # 🦋 ∅∪∩∋∈∉ ≡ ≢ « » ∴ +use v6.d; +use Test; + +=begin comment +220-1: Common Characters Submitted by: Mohammad S Anwar +Given a list of words, return the list of characters (sorted alphabeticall) found in every word of the given list. + +Example 1 +Input: @words = ("Perl", "Rust", "Raku") +Output: ("r") +Example 2 +Input: @words = ("love", "live", "leave") +Output: ("e", "l", "v") +=end comment + +my @Test = + < r >, ("Perl", "Rust", "Raku"), + < e l v >, ("love", "live", "leave"), + (), ("happiness", "rich", "common"), + < e s >, ("happiness", "riches", "commonness"), + < g o >, <god dog dogooder dogged gold goose gooseneck + gosling goes vetoing gasoline gooey plodding + goon gong Gideon gobsmacking forgotten foundling + dingdong dotting encompassing openning begoggled + monogamy + >, + < g o >, ( <god dog dogooder dogged gold goose gooseneck + gosling goes vetoing gasoline gooey plodding + goon gong Gideon gobsmacking forgotten foundling + dingdong dotting encompassing openning begoggled + monogamy + > xx 1000).flat, +; +plan @Test ÷ 2; + +sub universal-letters( @a) { + my @w = @a».lc; + my @ret = @w.pop.comb; + for @w -> $word { + @ret = $word.comb.unique.grep( * ~~ @ret.any); + return [] if @ret ~~ Empty; + } + @ret.sort.Array; +} + +for @Test -> $exp, $in { + is universal-letters(@$in), @$exp, "@$exp.raku()\t<-- @$in[]"; +} +done-testing; + +my @word = ("happiness", "riches", "commonness"); +say "\nInput: @words = @word.raku()\nOutput: ", universal-letters(@word).raku; diff --git a/challenge-220/0rir/raku/ch-2.raku b/challenge-220/0rir/raku/ch-2.raku new file mode 100644 index 0000000000..3aa69a812a --- /dev/null +++ b/challenge-220/0rir/raku/ch-2.raku @@ -0,0 +1,60 @@ +#!/usr/bin/env raku +# :vim ft=raku sw=4 expandtab # 🦋 ∅∪∩∋∈∉ ≡ ≢ « » ∴ +use v6.d; +use Test; + +=begin comment +220-2: Squareful Submitted by: Mohammad S Anwar +Given an array of integers, @ints, find all permutations of the array +that are squareful. + +An array is squareful if the sum of every pair of adjacent elements is a perfect square. + +Example 1: +Input: @ints = (1, 17, 8) +Output: (1, 8, 17), (17, 8, 1) + +(1, 8, 17) since 1 + 8 => 9, a perfect square and also 8 + 17 => 25 is perfect square too. +(17, 8, 1) since 17 + 8 => 25, a perfect square and also 8 + 1 => 9 is perfect square too. +Example 2: +Input: @ints = (2, 2, 2) +Output: (2, 2, 2) + +There is only one permutation possible. +=end comment + +my @Test = + # exp in + (1,17,8), ((1,8,17), (17,8,1)), + (2,2,2), ((2,2,2),), + (1,24), ((1,24),(24,1),), + (1,3,6,10,15,10), ((1,3,6,10,15,10),(3,1,15,10,6,10),(10,6,3,1,15,10), + (10,6,10,15,1,3),(10,15,1,3,6,10),( 10,15,10,6,3,1),), + (1,6,9,10), (( Empty),), +; +plan @Test ÷ 2; + +# is a one-dim array squareful +sub squareful( @a -->Bool) { + my $r = 0..1; + for 1..^@a { + my $sqr = @a[@$r].sum.sqrt; + return False if $sqr != $sqr.Int; + $r += 1; + } + True +} + +sub all-squareful-perms( @a -->List ){ + @a.permutations.grep( *.&squareful).unique( :with(&[eqv])).List; +} + +for @Test -> @in, @exp { + my $r = all-squareful-perms(@in); + is $r, @exp, "@exp.raku() <- @in.raku()"; +} +done-testing; + +my @int = (3,6,10,15); +say "\nInput: @ints = (@int[])\nOutput: ", all-squareful-perms(@int).raku; + |