Solutions for challenge 073

2 files changed, 36 insertions, 0 deletions

diff --git a/challenge-073/jo-37/perl/ch-1.pl b/challenge-073/jo-37/perl/ch-1.pl
new file mode 100755
index 0000000000..67372bc6b5
--- /dev/null
+++ b/challenge-073/jo-37/perl/ch-1.pl
@@ -0,0 +1,18 @@
+#!/usr/bin/perl
+
+use Test2::V0;
+use List::Util 'min';
+
+# first arg: window size
+# remaining args: input array
+sub sliding_min {
+	my $S = shift;
+	
+	# Take the minimum of a sliding window
+	map min(@_[$_ .. $_ + $S - 1]), 0 .. $#_ - $S + 1;
+}
+
+is [sliding_min 3, (1, 5, 0, 2, 9, 3, 7, 6, 4, 8)],
+	[0, 0, 0, 2, 3, 3, 4, 4], 'example from challenge';
+
+done_testing;
diff --git a/challenge-073/jo-37/perl/ch-2.pl b/challenge-073/jo-37/perl/ch-2.pl
new file mode 100755
index 0000000000..82c9b605c0
--- /dev/null
+++ b/challenge-073/jo-37/perl/ch-2.pl
@@ -0,0 +1,18 @@
+#!/usr/bin/perl
+
+use Test2::V0;
+use List::Util 'min';
+
+sub left_min {
+	# For all array elements:
+	# Take the array slice "left" of the element,
+	# filter for elements smaller than the selected, 
+	# take the mininum of those
+	# and set the result to zero if there was nothing to minimize.
+	map {my $e = $_[$_]; min(grep {$_ < $e} @_[0 .. $_-1]) // 0} 0 .. $#_;
+}
+
+is [left_min 7, 8, 3, 12, 10], [0, 7, 0, 3, 3], 'first example';
+is [left_min 4, 6, 5], [0, 4, 4], 'second example';
+
+done_testing;