- Added solutions by Belmark Caday.

2 files changed, 62 insertions, 0 deletions

diff --git a/challenge-126/belmark-caday/perl/ch-1.pl b/challenge-126/belmark-caday/perl/ch-1.pl
new file mode 100644
index 0000000000..1ae4724034
--- /dev/null
+++ b/challenge-126/belmark-caday/perl/ch-1.pl
@@ -0,0 +1,18 @@
+sub countNumbers {
+    my $n = shift;
+    my $count = 0;
+
+    for ( $i = 1; $i <= $n; $i++ ) {
+        my @stringSplit = split(//, "$i");
+
+        my $j = 0;
+        foreach my $s ( @stringSplit ) {
+            $s == 1 ? last : $j++;
+        }
+        $count++ if $j == scalar @stringSplit; # We arrived at the end of the list without finding 1
+    }
+    print "Count is : $count \n";
+}
+
+countNumbers(25);
+
diff --git a/challenge-126/belmark-caday/perl/ch-2.pl b/challenge-126/belmark-caday/perl/ch-2.pl
new file mode 100644
index 0000000000..b89c70266a
--- /dev/null
+++ b/challenge-126/belmark-caday/perl/ch-2.pl
@@ -0,0 +1,44 @@
+sub mineSweeperMatrix {
+    my $matrix = shift;
+
+    for ( my $i = 0; $i < scalar @$matrix; $i++ ) {
+        for ( my $j =0; $j < scalar @{$matrix->[$i]}; $j++ ) {
+            if ( $matrix->[$i]->[$j] eq '*') {
+                my @loopList1 = ($i -1, $i, $i + 1);
+                my @loopList2 = ($j -1, $j, $j + 1);
+                my $mineCount = 0;
+
+                foreach my $lpLst1 ( @loopList1 ) {
+                    next if $lpLst1 < 0;
+                    if (defined $matrix->[$lpLst1]) {
+                        foreach my $lpLst2 ( @loopList2 ) {
+                            next if $lpLst2 < 0;
+                            next unless defined $matrix->[$lpLst1]->[$lpLst2];
+                            next if $lpLst2 == $j && $lpLst1 == $i;
+                            $mineCount++ if $matrix->[$lpLst1]->[$lpLst2] eq 'x';
+                        }
+                    }
+                    else {
+                        next;
+                    }
+                }
+
+                print $mineCount . ", ";
+            }
+            else {
+                print 'x, ';
+            }
+        }
+        print "\n";
+    }
+}
+
+my $testData = [
+    ['x', '*', '*', '*', 'x', '*', 'x', 'x', 'x', 'x'],
+    ['*', '*', '*', '*', '*', '*', '*', '*', '*', 'x'],
+    ['*', '*', '*', '*', 'x', '*', 'x', '*', 'x', '*'],
+    ['*', '*', '*', 'x', 'x', '*', '*', '*', '*', '*'],
+    ['x', '*', '*', '*', 'x', '*', '*', '*', '*', 'x']
+];
+
+mineSweeperMatrix($testData);