From a1353111f06f01eae1a495e431aa954d93124bde Mon Sep 17 00:00:00 2001
From: Walt Mankowski <waltman@pobox.com>
Date: Mon, 28 Sep 2020 19:37:09 -0400
Subject: perl code for challenge 80 task 1

---
 challenge-080/walt-mankowski/perl/ch-1.pl | 24 ++++++++++++++++++++++++
 1 file changed, 24 insertions(+)
 create mode 100644 challenge-080/walt-mankowski/perl/ch-1.pl

diff --git a/challenge-080/walt-mankowski/perl/ch-1.pl b/challenge-080/walt-mankowski/perl/ch-1.pl
new file mode 100644
index 0000000000..fd08ac491f
--- /dev/null
+++ b/challenge-080/walt-mankowski/perl/ch-1.pl
@@ -0,0 +1,24 @@
+#!/usr/bin/env perl
+use strict;
+use warnings;
+use feature qw(:5.32);
+use experimental qw(signatures);
+
+# TASK #1 › Smallest Positive Number Bits
+# Submitted by: Mohammad S Anwar
+#
+# You are given unsorted list of integers @N.
+#
+# Write a script to find out the smallest positive number missing.
+
+my %h = map { $_ => 1 } @ARGV;
+
+my $n = 1;
+while (1) {
+    if (defined $h{$n}) {
+        $n++;
+    } else {
+        say $n;
+        last;
+    }
+}
-- 
cgit 


From 78c4b3edb3294a781653d9ff67126b20add144a9 Mon Sep 17 00:00:00 2001
From: Walt Mankowski <waltman@pobox.com>
Date: Mon, 28 Sep 2020 19:50:13 -0400
Subject: changed variable names to match description

---
 challenge-080/walt-mankowski/perl/ch-1.pl | 10 +++++-----
 1 file changed, 5 insertions(+), 5 deletions(-)

diff --git a/challenge-080/walt-mankowski/perl/ch-1.pl b/challenge-080/walt-mankowski/perl/ch-1.pl
index fd08ac491f..dd356e9bee 100644
--- a/challenge-080/walt-mankowski/perl/ch-1.pl
+++ b/challenge-080/walt-mankowski/perl/ch-1.pl
@@ -11,14 +11,14 @@ use experimental qw(signatures);
 #
 # Write a script to find out the smallest positive number missing.
 
-my %h = map { $_ => 1 } @ARGV;
+my %n = map { $_ => 1 } @ARGV;
 
-my $n = 1;
+my $i = 1;
 while (1) {
-    if (defined $h{$n}) {
-        $n++;
+    if (defined $n{$i}) {
+        $i++;
     } else {
-        say $n;
+        say $i;
         last;
     }
 }
-- 
cgit 


From e7323444df339dabb8d0be4dfeaa493c826e4bac Mon Sep 17 00:00:00 2001
From: Walt Mankowski <waltman@pobox.com>
Date: Mon, 28 Sep 2020 19:53:11 -0400
Subject: perl code for challenge 80 task 2

---
 challenge-080/walt-mankowski/perl/ch-2.pl | 33 +++++++++++++++++++++++++++++++
 1 file changed, 33 insertions(+)
 create mode 100644 challenge-080/walt-mankowski/perl/ch-2.pl

diff --git a/challenge-080/walt-mankowski/perl/ch-2.pl b/challenge-080/walt-mankowski/perl/ch-2.pl
new file mode 100644
index 0000000000..d81887113b
--- /dev/null
+++ b/challenge-080/walt-mankowski/perl/ch-2.pl
@@ -0,0 +1,33 @@
+#!/usr/bin/env perl
+use strict;
+use warnings;
+use feature qw(:5.32);
+use experimental qw(signatures);
+
+# TASK #2 › Count Candies
+# Submitted by: Mohammad S Anwar
+#
+# You are given rankings of @N candidates.
+#
+# Write a script to find out the total candies needed for all
+# candidates. You are asked to follow the rules below:
+#
+# a) You must given at least one candy to each candidate.
+#
+# b) Candidate with higher ranking get more candies than their
+#    immediate neighbors on either side.
+
+my @n = @ARGV;
+my $candy = @n;
+
+# right neighbors
+for my $i (0..$#n-1) {
+    $candy++ if $n[$i] > $n[$i+1];
+}
+
+# left neighbors
+for my $i (1..$#n) {
+    $candy++ if $n[$i] > $n[$i-1];
+}
+
+say $candy;
-- 
cgit 


From e470d37b013fccc386c5a144050a21ff9908f259 Mon Sep 17 00:00:00 2001
From: Walt Mankowski <waltman@pobox.com>
Date: Mon, 28 Sep 2020 19:53:27 -0400
Subject: python code for challenge 80

---
 challenge-080/walt-mankowski/python/ch-1.py | 11 +++++++++++
 challenge-080/walt-mankowski/python/ch-2.py | 16 ++++++++++++++++
 2 files changed, 27 insertions(+)
 create mode 100644 challenge-080/walt-mankowski/python/ch-1.py
 create mode 100644 challenge-080/walt-mankowski/python/ch-2.py

diff --git a/challenge-080/walt-mankowski/python/ch-1.py b/challenge-080/walt-mankowski/python/ch-1.py
new file mode 100644
index 0000000000..0972720949
--- /dev/null
+++ b/challenge-080/walt-mankowski/python/ch-1.py
@@ -0,0 +1,11 @@
+from sys import argv
+
+n = { int(x) for x in argv[1:] }
+
+i = 1
+while (True):
+    if i in n:
+        i += 1
+    else:
+        print(i)
+        break
diff --git a/challenge-080/walt-mankowski/python/ch-2.py b/challenge-080/walt-mankowski/python/ch-2.py
new file mode 100644
index 0000000000..15346a1a41
--- /dev/null
+++ b/challenge-080/walt-mankowski/python/ch-2.py
@@ -0,0 +1,16 @@
+from sys import argv
+
+n = [int(x) for x in argv[1:]]
+candy = len(n)
+
+# right neighbors
+for i in range(len(n)-1):
+    if n[i] > n[i+1]:
+        candy += 1
+
+# left neighbors
+for i in range(1, len(n)):
+    if n[i] > n[i-1]:
+        candy += 1
+
+print(candy)
-- 
cgit 


From 44e8990c7371fbbdabe1fe5924a3484031b374e6 Mon Sep 17 00:00:00 2001
From: Walt Mankowski <waltman@pobox.com>
Date: Mon, 28 Sep 2020 20:23:05 -0400
Subject: blog post for challenge 80

---
 challenge-080/walt-mankowski/blog.txt | 1 +
 1 file changed, 1 insertion(+)
 create mode 100644 challenge-080/walt-mankowski/blog.txt

diff --git a/challenge-080/walt-mankowski/blog.txt b/challenge-080/walt-mankowski/blog.txt
new file mode 100644
index 0000000000..ddc25b9fc7
--- /dev/null
+++ b/challenge-080/walt-mankowski/blog.txt
@@ -0,0 +1 @@
+http://www.mawode.com/blog/blog/2020/09/28/perl-weekly-challenge-80/
-- 
cgit