- Added solutions by Laurent Rosenfeld.

2 files changed, 10 insertions, 0 deletions

diff --git a/challenge-127/laurent-rosenfeld/perl/ch-1.pl b/challenge-127/laurent-rosenfeld/perl/ch-1.pl
new file mode 100644
index 0000000000..561e75359b
--- /dev/null
+++ b/challenge-127/laurent-rosenfeld/perl/ch-1.pl
@@ -0,0 +1,3 @@
+use strict; use warnings; use feature “say”;
+
+sub isdisjoint { my ($s1, $s2) = @; my %h1 = map { $_ => 1 } @$s1; for my $d (@$s2) { return 0 if exists $h1{$d}; } return 1; } say isdisjoint [1, 2, 5, 3, 4], [4, 6, 7, 8, 9]; say isdisjoint [1, 3, 5, 7, 9], [0, 2, 4, 6, 8];
diff --git a/challenge-127/laurent-rosenfeld/raku/ch-1.raku b/challenge-127/laurent-rosenfeld/raku/ch-1.raku
new file mode 100644
index 0000000000..312ad53fe6
--- /dev/null
+++ b/challenge-127/laurent-rosenfeld/raku/ch-1.raku
@@ -0,0 +1,7 @@
+use v6;
+
+sub is-disjoint ($s1, $s2) {
+    return ($s1 (&) $s2).elems == 0 ?? 1 !! 0;
+}
+say is-disjoint (1, 2, 5, 3, 4), (4, 6, 7, 8, 9);
+say is-disjoint (1, 3, 5, 7, 9), (0, 2, 4, 6, 8);