diff options
Diffstat (limited to 'challenge-242')
97 files changed, 3596 insertions, 58 deletions
diff --git a/challenge-242/clifton-wood/raku/ch-1.raku b/challenge-242/clifton-wood/raku/ch-1.raku new file mode 100644 index 0000000000..de234fc88c --- /dev/null +++ b/challenge-242/clifton-wood/raku/ch-1.raku @@ -0,0 +1,10 @@ +my %h; +my @a = <a b c>; +my @b = <b c f>; %h{ |@a, |@b } »=» 1; +my (@m-a, @m-b); +for %h.keys { + @m-a.push: $_ unless @a.first($_).defined; + @m-b.push: $_ unless @b.first($_).defined; +} +@m-a.gist.say; +@m-b.gist.say; diff --git a/challenge-242/clifton-wood/raku/ch-2.raku b/challenge-242/clifton-wood/raku/ch-2.raku new file mode 100644 index 0000000000..1831ded48e --- /dev/null +++ b/challenge-242/clifton-wood/raku/ch-2.raku @@ -0,0 +1,4 @@ +my @matrix = ([1, 1, 0], [1, 0, 1], [0, 0, 0]); +@matrix.map( *.reverse.map( *.not.Int ) ).gist.say + + diff --git a/challenge-242/e-choroba/perl/ch-1.pl b/challenge-242/e-choroba/perl/ch-1.pl new file mode 100755 index 0000000000..93b46b9b45 --- /dev/null +++ b/challenge-242/e-choroba/perl/ch-1.pl @@ -0,0 +1,26 @@ +#!/usr/bin/perl +use warnings; +use strict; +use experimental qw( signatures ); + +use Tie::IxHash; + +sub missing_members($arr1, $arr2) { + tie my %seen, 'Tie::IxHash'; + for my $i (0, 1) { + $seen{$_}[$i] = 1 for @{ ($arr1, $arr2)[$i] }; + } + my @missing = ([], []); + for my $e (keys %seen) { + push @{ $missing[ ! $seen{$e}[0] ] }, $e + unless 2 == grep $_, @{ $seen{$e} }; + } + return \@missing +} + +use Test2::V0; +plan 2 + 1; + +is missing_members([1, 2, 3], [2, 4, 6]), [[1, 3], [4, 6]], 'Example 1'; +is missing_members([1, 2, 3, 3], [1, 1, 2, 2]), [[3], []], 'Example 2'; +is missing_members([1, 1, 2, 2], [1, 2, 3, 3]), [[], [3]], 'First empty'; diff --git a/challenge-242/e-choroba/perl/ch-2.pl b/challenge-242/e-choroba/perl/ch-2.pl new file mode 100755 index 0000000000..199eb685ce --- /dev/null +++ b/challenge-242/e-choroba/perl/ch-2.pl @@ -0,0 +1,26 @@ +#!/usr/bin/perl +use warnings; +use strict; +use experimental qw( signatures ); + +use PDL; + +sub flip_matrix($m) { + ! pdl($m)->slice('-1:0:0') +} + +use Test::More tests => 3; + +is_deeply flip_matrix("[1 1 0]\n[0 1 1]\n[0 0 1]")->unpdl, + [[1, 0, 0], [0, 0, 1], [0, 1, 1]], + 'Unnamed example'; + +is_deeply flip_matrix([[1, 1, 0], [1, 0, 1], [0, 0, 0]])->unpdl, + [[1, 0, 0], [0, 1, 0], [1, 1, 1]], + 'Example 1'; + +is_deeply flip_matrix( + [[1, 1, 0, 0], [1, 0, 0, 1], [0, 1, 1, 1], [1, 0, 1, 0]] +)->unpdl, + [[1, 1, 0, 0], [0, 1, 1, 0], [0, 0, 0, 1], [1, 0, 1, 0]], + 'Example 2'; diff --git a/challenge-242/eric-cheung/python/ch-1.py b/challenge-242/eric-cheung/python/ch-1.py new file mode 100755 index 0000000000..b3d79cc846 --- /dev/null +++ b/challenge-242/eric-cheung/python/ch-1.py @@ -0,0 +1,20 @@ +
+## Example 1
+## arrNum_01 = [1, 2, 3]
+## arrNum_02 = [2, 4, 6]
+
+## Example 2
+arrNum_01 = [1, 2, 3, 3]
+arrNum_02 = [1, 1, 2, 2]
+
+arrOutput = []
+
+arrOutput_01 = [nLoop for nLoop in list(set(arrNum_01)) if nLoop not in list(set(arrNum_02))]
+if len(arrOutput_01) > 0:
+ arrOutput.append(arrOutput_01)
+
+arrOutput_02 = [nLoop for nLoop in list(set(arrNum_02)) if nLoop not in list(set(arrNum_01))]
+if len(arrOutput_02) > 0:
+ arrOutput.append(arrOutput_02)
+
+print (arrOutput)
diff --git a/challenge-242/eric-cheung/python/ch-2.py b/challenge-242/eric-cheung/python/ch-2.py new file mode 100755 index 0000000000..9d487ad23a --- /dev/null +++ b/challenge-242/eric-cheung/python/ch-2.py @@ -0,0 +1,11 @@ +
+arrMatrix = [[1, 1, 0], [0, 1, 1], [0, 0, 1]] ## Example 0
+## arrMatrix = [[1, 1, 0], [1, 0, 1], [0, 0, 0]] ## Example 1
+## arrMatrix = [[1, 1, 0, 0], [1, 0, 0, 1], [0, 1, 1, 1], [1, 0, 1, 0]] ## Example 2
+
+arrOutput = []
+
+for arrLoop in arrMatrix:
+ arrOutput.append([1 - nLoop for nLoop in arrLoop[::-1]])
+
+print (arrOutput)
diff --git a/challenge-242/jeanluc2020/blog-1.txt b/challenge-242/jeanluc2020/blog-1.txt new file mode 100644 index 0000000000..3609be466d --- /dev/null +++ b/challenge-242/jeanluc2020/blog-1.txt @@ -0,0 +1 @@ +http://gott-gehabt.de/800_wer_wir_sind/thomas/Homepage/Computer/perl/theweeklychallenge-242-1.html diff --git a/challenge-242/jeanluc2020/blog-2.txt b/challenge-242/jeanluc2020/blog-2.txt new file mode 100644 index 0000000000..97547946a0 --- /dev/null +++ b/challenge-242/jeanluc2020/blog-2.txt @@ -0,0 +1 @@ +http://gott-gehabt.de/800_wer_wir_sind/thomas/Homepage/Computer/perl/theweeklychallenge-242-2.html diff --git a/challenge-242/jeanluc2020/perl/ch-1.pl b/challenge-242/jeanluc2020/perl/ch-1.pl new file mode 100755 index 0000000000..d3b7aaf045 --- /dev/null +++ b/challenge-242/jeanluc2020/perl/ch-1.pl @@ -0,0 +1,62 @@ +#!/usr/bin/perl +# https://theweeklychallenge.org/blog/perl-weekly-challenge-242/#TASK1 +# +# Task 1: Missing Members +# ======================= +# +# You are given two arrays of integers. +# +# Write a script to find out the missing members in each other arrays. +# +## Example 1 +## +## Input: @arr1 = (1, 2, 3) +## @arr2 = (2, 4, 6) +## Output: ([1, 3], [4, 6]) +## +## (1, 2, 3) has 2 members (1, 3) missing in the array (2, 4, 6). +## (2, 4, 6) has 2 members (4, 6) missing in the array (1, 2, 3). +# +## Example 2 +## +## Input: @arr1 = (1, 2, 3, 3) +## @arr2 = (1, 1, 2, 2) +## Output: ([3]) +## +## (1, 2, 3, 3) has 2 members (3, 3) missing in the array (1, 1, 2, 2). Since they are same, keep just one. +## (1, 1, 2, 2) has 0 member missing in the array (1, 2, 3, 3). +# +############################################################ +## +## discussion +## +############################################################ +# +# For each element of each array, if it is not in the other array, +# save it for the output. +# Example 2 has a caveat though, by not returning an empty array in +# case of no missing elements it is unclear in which of the arrays +# the element was originally. It's better to return an empty array +# here, so let's just do that instead. + +missing_members( [ 1, 2, 3 ], [ 2, 4, 6 ] ); +missing_members( [ 1, 2, 3, 3 ], [ 1, 1, 2, 2 ] ); + +sub missing_members { + my ($arr1, $arr2) = @_; + print "Input: (" . join(", ", @$arr1) . "), (" . join(", ", @$arr2) . ")\n"; + my (@res1, @res2, %keys1, %keys2); + map { $keys1{$_} = 1; } @$arr1; + map { $keys2{$_} = 1; } @$arr2; + my %seen = (); + foreach my $elem (@$arr1) { + push @res1, $elem unless $keys2{$elem} or $seen{$elem}; + $seen{$elem} = 1; + } + %seen = (); + foreach my $elem (@$arr2) { + push @res2, $elem unless $keys1{$elem} or $seen{$elem}; + $seen{$elem} = 1; + } + print "Output: ([" . join(", ", @res1) . "], [" . join(", ", @res2) . "])\n"; +} diff --git a/challenge-242/jeanluc2020/perl/ch-2.pl b/challenge-242/jeanluc2020/perl/ch-2.pl new file mode 100755 index 0000000000..ed69f9eab7 --- /dev/null +++ b/challenge-242/jeanluc2020/perl/ch-2.pl @@ -0,0 +1,74 @@ +#!/usr/bin/perl +# https://theweeklychallenge.org/blog/perl-weekly-challenge-242/#TASK2 +# +# Task 2: Flip Matrix +# =================== +# +# You are given n x n binary matrix. +# +# Write a script to flip the given matrix as below. +# +# 1 1 0 +# 0 1 1 +# 0 0 1 +# +# a) Reverse each row +# +# 0 1 1 +# 1 1 0 +# 1 0 0 +# +# b) Invert each member +# +# 1 0 0 +# 0 0 1 +# 0 1 1 +# +# +## Example 1 +## +## Input: @matrix = ([1, 1, 0], [1, 0, 1], [0, 0, 0]) +## Output: ([1, 0, 0], [0, 1, 0], [1, 1, 1]) +# +## Example 2 +## +## Input: @matrix = ([1, 1, 0, 0], [1, 0, 0, 1], [0, 1, 1, 1], [1, 0, 1, 0]) +## Output: ([1, 1, 0, 0], [0, 1, 1, 0], [0, 0, 0, 1], [1, 0, 1, 0]) +# +############################################################ +## +## discussion +## +############################################################ +# +# Just reverse and invert. Nothing complicated. + +flip_matrix([1, 1, 0], [1, 0, 1], [0, 0, 0]); +flip_matrix([1, 1, 0, 0], [1, 0, 0, 1], [0, 1, 1, 1], [1, 0, 1, 0]); + +sub flip_matrix { + my @rows = @_; + my @result; + print "Input: ("; + foreach my $row (@rows) { + print "[" . join(", ", @$row) . "],"; + } + print ")\n"; + foreach my $row (@rows) { + push @result, [ inverted( reverse @$row ) ]; + } + print "Ouput: ("; + foreach my $row (@result) { + print "[" . jo |