Merge pull request #7757 from E7-87-83/newt

Week 208

2 files changed, 83 insertions, 0 deletions

diff --git a/challenge-208/cheok-yin-fung/perl/ch-1.pl b/challenge-208/cheok-yin-fung/perl/ch-1.pl
new file mode 100644
index 0000000000..1cddf391f5
--- /dev/null
+++ b/challenge-208/cheok-yin-fung/perl/ch-1.pl
@@ -0,0 +1,43 @@
+# The Weekly Challenge 208
+# Task 1 Minimum Index Sum
+use v5.30.0;
+use warnings;
+use Array::Utils qw/intersect/;
+
+sub aindex {
+    my $item = $_[0];
+    my @list = $_[1]->@*;
+    for my $i (0..$#list) {
+        return $i if $item eq $list[$i];
+    }
+    return undef;
+}
+
+sub mis {
+    my @ans = ();
+    my @list1 = $_[0]->@*;
+    my @list2 = $_[1]->@*;
+    my @comm  = intersect(@list1, @list2);
+    my $mis = $#list1 + $#list2;
+    foreach (@comm) {
+        my $ind_sum = aindex($_, [@list1]) + aindex($_, [@list2]);
+        if ($ind_sum == $mis) {
+            push @ans, $_;
+        } elsif ($ind_sum < $mis) {
+            $mis = $ind_sum;
+            @ans = ($_);
+        }
+    }
+    return [sort {$a cmp $b} @ans];
+}
+
+use Test::More tests=>3; 
+use Test::Deep;
+cmp_deeply 
+    mis(["Perl", "Raku", "Love"], ["Raku", "Perl", "Hate"]), 
+    ["Perl", "Raku"];
+cmp_deeply mis(["A", "B", "C"], ["D", "E", "F"]),
+    [];
+cmp_deeply
+    mis(["A", "B", "C"], ["C", "A", "B"]),
+    ["A"];
diff --git a/challenge-208/cheok-yin-fung/perl/ch-2.pl b/challenge-208/cheok-yin-fung/perl/ch-2.pl
new file mode 100644
index 0000000000..2d009f2511
--- /dev/null
+++ b/challenge-208/cheok-yin-fung/perl/ch-2.pl
@@ -0,0 +1,40 @@
+# The Weekly Challenge 208
+# Task 2 Duplicate and Missing
+# Assume the array has three or more elements.
+use v5.30.0;
+use warnings;
+use List::MoreUtils qw/slide/;
+
+sub aindex {
+    my $item = $_[0];
+    my @list = $_[1]->@*;
+    for my $i (0..$#list) {
+        return $i if $item == $list[$i];
+    }
+    return undef;
+}
+
+sub dm {
+    my @arr = @_;
+    my $dup, my $mis;
+    my $locator;
+    $locator = $arr[0]!=$arr[1] ? $arr[0] : $arr[-1];
+    my $ref_ind = $locator==$arr[0] ? 0 : $#arr;
+    my $shft = $locator-$ref_ind;
+    for my $i (0..$#arr) {
+        if ($shft+$i != $arr[$i]) {
+            ($dup, $mis) = ($arr[$i], $shft+$i);
+            last;
+        }
+    }
+    return [$dup, $mis] if defined($dup);
+    return -1;
+}
+
+use Test::More tests=>5;
+use Test::Deep;
+cmp_deeply dm(1,2,2,4), [2,3];
+cmp_deeply dm(1,2,3,4), -1;
+cmp_deeply dm(1,2,3,3), [3,4];
+cmp_deeply dm(2,2,3), [2,1];
+cmp_deeply dm(3,3,4), [3,2];