initial commit

2 files changed, 50 insertions, 0 deletions

diff --git a/challenge-182/adam-russell/perl/ch-1.pl b/challenge-182/adam-russell/perl/ch-1.pl
new file mode 100644
index 0000000000..08c1857330
--- /dev/null
+++ b/challenge-182/adam-russell/perl/ch-1.pl
@@ -0,0 +1,20 @@
+use v5.36; 
+use strict;
+use warnings;
+##
+# You are given a list of integers.
+# Write a script to find the index of the first biggest number in the list.
+##
+sub index_biggest{
+    my(@numbers) = @_;
+    my @sorted = sort {$b <=> $a} @numbers; 
+    map { return $_ if $numbers[$_] == $sorted[0] } 0 .. @numbers - 1; 
+}
+
+MAIN:{
+    my @n;
+    @n = (5, 2, 9, 1, 7, 6);
+    print index_biggest(@n) . "\n";  
+    @n = (4, 2, 3, 1, 5, 0);  
+    print index_biggest(@n) . "\n";  
+}
diff --git a/challenge-182/adam-russell/perl/ch-2.pl b/challenge-182/adam-russell/perl/ch-2.pl
new file mode 100644
index 0000000000..d02db44177
--- /dev/null
+++ b/challenge-182/adam-russell/perl/ch-2.pl
@@ -0,0 +1,30 @@
+use v5.36;
+use strict;
+use warnings;
+##
+# Given a list of absolute Linux file paths, determine the 
+# deepest path to the directory that contains all of them.
+##
+sub deepest_path{
+    my(@paths) = @_;
+    my @path_lengths_sorted = sort { $a cmp $b } map { length($_) } @paths;
+    for my $i (0 .. $path_lengths_sorted[0] - 1){
+
+    }    
+}
+
+MAIN:{
+    my $data = do{
+        local $/;
+        <DATA>; 
+    };
+    my @paths = split(/\n/, $data);  
+    print deepest_path(@paths) . "\n"; 
+}
+
+__DATA__
+/a/b/c/1/x.pl
+/a/b/c/d/e/2/x.pl
+/a/b/c/d/3/x.pl
+/a/b/c/4/x.pl
+/a/b/c/d/5/x.pl