- Added solutions by Alexander Karelas.

2 files changed, 34 insertions, 0 deletions

diff --git a/challenge-050/alexander-karelas/perl/ch-1.pl b/challenge-050/alexander-karelas/perl/ch-1.pl
new file mode 100644
index 0000000000..c9526d530b
--- /dev/null
+++ b/challenge-050/alexander-karelas/perl/ch-1.pl
@@ -0,0 +1,19 @@
+#!/usr/bin/env perl
+
+use v5.28;
+use warnings;
+
+use Data::Dumper;
+
+my @intervals = ([2,7], [3,9], [10,12], [15,19], [18,22]);
+
+# solution
+@intervals = sort {$a->[0] <=> $b->[0]} @intervals;
+for (my $i = 0; $i < $#intervals; $i++) {
+    if ($intervals[$i+1][0] <= $intervals[$i][1] and $intervals[$i+1][1] > $intervals[$i][1]) {
+        $intervals[$i][1] = $intervals[$i+1][1];
+        splice @intervals, $i+1, 1;
+    }
+}
+
+print Dumper(\@intervals);
diff --git a/challenge-050/alexander-karelas/perl/ch-2.pl b/challenge-050/alexander-karelas/perl/ch-2.pl
new file mode 100644
index 0000000000..5673914c0a
--- /dev/null
+++ b/challenge-050/alexander-karelas/perl/ch-2.pl
@@ -0,0 +1,15 @@
+#!/usr/bin/env perl
+
+use v5.28;
+use warnings;
+
+my @L = (2, 6, 1, 3);
+
+# solution
+my @l = sort { $b <=> $a } @L;
+my $noble;
+for (my $i = 0; $i < @l and $l[$i] >= $i; $i++) {
+    $noble = $i if $l[$i] == $i;
+}
+
+say defined $noble ? "Noble integer is: $noble" : "There is no noble integer in this set";