Perl solution for challenge-289/ch-1

1 files changed, 19 insertions, 0 deletions

diff --git a/challenge-289/vinod-k/perl/ch-1.perl b/challenge-289/vinod-k/perl/ch-1.perl
new file mode 100644
index 0000000000..7ae5738224
--- /dev/null
+++ b/challenge-289/vinod-k/perl/ch-1.perl
@@ -0,0 +1,19 @@
+#!/usr/bin/perl
+
+use strict;
+use warnings;
+use List::MoreUtils qw(uniq);
+
+my @numbers = split(/\s+/, $ARGV[0]);
+
+my @sorted_array = uniq(sort { $b <=> $a } @numbers);
+
+my $size = scalar @sorted_array;
+
+if ($size == 0){
+    print "We need atleast one input..\n";
+} elsif ($size == 1 || $size == 2) {
+    print "We have $size elements in the given input, so answer is: $sorted_array[0]\n";
+} else {
+    print "We have $size elements in the given input, so answer is: $sorted_array[2]\n";
+}
\ No newline at end of file