Merge branch 'duanepowell-new-branch'

1 files changed, 43 insertions, 0 deletions

diff --git a/challenge-087/duane-powell/perl/ch-1.pl b/challenge-087/duane-powell/perl/ch-1.pl
new file mode 100755
index 0000000000..fd1bd968fe
--- /dev/null
+++ b/challenge-087/duane-powell/perl/ch-1.pl
@@ -0,0 +1,43 @@
+#!/usr/bin/perl
+use warnings;
+use strict;
+use feature 'say';
+
+# Problem: https://perlweeklychallenge.org/blog/perl-weekly-challenge-087/ TASK #1
+# You are given an unsorted array of integers @N.
+# Write a script to find the longest consecutive sequence. Print 0 if none sequence found
+
+my @N = @ARGV;
+unless (scalar @N) {
+	# @N is empty so fill with random numbers 
+	push @N, int(rand(100))+1 for (1..40);
+	print join(',',@N), "\n";
+	
+}
+
+@N = sort @N;
+my @longest;
+
+# Init @temp with first elemenet of @N
+my @temp = (shift @N); 
+while (scalar @N) { 
+
+	# Is the last element of @temp consecutive with the next element of @N ?
+	if ( $temp[-1]+1 == $N[0] ) {
+		# Yes, push element
+		push @temp, shift @N;
+	} 
+	else {
+		# No, re-init @temp with first element of @N
+		@temp = (shift @N);
+	}
+		
+	# Note: the winner of ties go to the first sequence found
+	@longest = @temp if (scalar @temp > scalar @longest);
+
+} 
+
+say scalar(@longest) ? join(',',@longest) : 0;
+exit;
+
+