trackler 2.2.0.3 → 2.2.0.4

data/tracks/perl5/exercises/matrix/README.md

@@ -0,0 +1,45 @@
+# Matrix
+
+Given a string representing a matrix of numbers, return the rows and columns of
+that matrix.
+
+So given a string with embedded newlines like:
+
+> 9 8 7  
+> 5 3 2  
+> 6 6 7  
+
+representing this matrix:
+
+```plain
+    0  1  2
+  |---------
+0 | 9  8  7
+1 | 5  3  2
+2 | 6  6  7
+```
+
+your code should be able to spit out:
+
+- A list of the rows, reading each row left-to-right while moving
+  top-to-bottom across the rows,
+- A list of the columns, reading each column top-to-bottom while moving
+  from left-to-right.
+
+The rows for our example matrix:
+
+- 9, 8, 7
+- 5, 3, 2
+- 6, 6, 7
+
+And its columns:
+
+- 9, 5, 6
+- 8, 3, 6
+- 7, 2, 7
+## Source
+
+Warmup to the `saddle-points` warmup. [http://jumpstartlab.com](http://jumpstartlab.com)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/perl5/exercises/meetup/README.md

@@ -0,0 +1,30 @@
+# Meetup
+
+Calculate the date of meetups.
+
+Typically meetups happen on the same day of the week.  In this exercise, you will take
+a description of a meetup date, and return the actual meetup date.
+
+Examples of general descriptions are:
+
+- the first Monday of January 2017
+- the third Tuesday of January 2017
+- the Wednesteenth of January 2017
+- the last Thursday of January 2017
+
+Note that "Monteenth", "Tuesteenth", etc are all made up words. There
+was a meetup whose members realized that there are exactly 7 numbered days in a month that
+end in '-teenth'. Therefore, one is guaranteed that each day of the week
+(Monday, Tuesday, ...) will have exactly one date that is named with '-teenth'
+in every month.
+
+Given examples of a meetup dates, each containing a month, day, year, and descriptor 
+(first, second, teenth, etc), calculate the date of the actual meetup.
+For example, if given "First Monday of January 2017", the correct meetup date is 2017/1/2
+ 
+## Source
+
+Jeremy Hinegardner mentioned a Boulder meetup that happens on the Wednesteenth of every month [https://twitter.com/copiousfreetime](https://twitter.com/copiousfreetime)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/perl5/exercises/minesweeper/README.md

@@ -0,0 +1,30 @@
+# Minesweeper
+
+Add the numbers to a minesweeper board.
+
+Minesweeper is a popular game where the user has to find the mines using
+numeric hints that indicate how many mines are directly adjacent
+(horizontally, vertically, diagonally) to a square.
+
+In this exercise you have to create some code that counts the number of
+mines adjacent to a square and transforms boards like this (where `*`
+indicates a mine):
+
+    +-----+
+    | * * |
+    |  *  |
+    |  *  |
+    |     |
+    +-----+
+
+into this:
+
+    +-----+
+    |1*3*1|
+    |13*31|
+    | 2*2 |
+    | 111 |
+    +-----+
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/perl5/exercises/nucleotide-count/README.md

@@ -0,0 +1,33 @@
+# Nucleotide Count
+
+Given a DNA string, compute how many times each nucleotide occurs in the string.
+
+DNA is represented by an alphabet of the following symbols: 'A', 'C',
+'G', and 'T'.
+
+Each symbol represents a nucleotide, which is a fancy name for the
+particular molecules that happen to make up a large part of DNA.
+
+Shortest intro to biochemistry EVAR:
+
+- twigs are to birds nests as
+- nucleotides are to DNA and RNA as
+- amino acids are to proteins as
+- sugar is to starch as
+- oh crap lipids
+
+I'm not going to talk about lipids because they're crazy complex.
+
+So back to nucleotides.
+
+DNA contains four types of them: adenine (`A`), cytosine (`C`), guanine
+(`G`), and thymine (`T`).
+
+RNA contains a slightly different set of nucleotides, but we don't care
+about that for now.
+## Source
+
+The Calculating DNA Nucleotides_problem at Rosalind [http://rosalind.info/problems/dna/](http://rosalind.info/problems/dna/)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/perl5/exercises/ocr-numbers/README.md

@@ -0,0 +1,85 @@
+# Ocr Numbers
+
+Given a 3 x 4 grid of pipes, underscores, and spaces, determine which number is
+represented, or whether it is garbled.
+
+# Step One
+
+To begin with, convert a simple binary font to a string containing 0 or 1.
+
+The binary font uses pipes and underscores, four rows high and three columns wide.
+
+```
+     _   #
+    | |  # zero.
+    |_|  #
+         # the fourth row is always blank
+```
+
+Is converted to "0"
+
+```
+         #
+      |  # one.
+      |  #
+         # (blank fourth row)
+```
+
+Is converted to "1"
+
+If the input is the correct size, but not recognizable, your program should return '?'
+
+If the input is the incorrect size, your program should return an error.
+
+# Step Two
+
+Update your program to recognize multi-character binary strings, replacing garbled numbers with ?
+
+# Step Three
+
+Update your program to recognize all numbers 0 through 9, both individually and as part of a larger string.
+
+```
+ _ 
+ _|
+|_ 
+   
+```
+
+Is converted to "2"
+
+```
+      _  _     _  _  _  _  _  _  #
+    | _| _||_||_ |_   ||_||_|| | # decimal numbers.
+    ||_  _|  | _||_|  ||_| _||_| #
+                                 # fourth line is always blank
+```
+
+Is converted to "1234567890"
+
+# Step Four
+
+Update your program to handle multiple numbers, one per line. When converting several lines, join the lines with commas.
+
+```
+    _  _ 
+  | _| _|
+  ||_  _|
+         
+    _  _ 
+|_||_ |_ 
+  | _||_|
+         
+ _  _  _ 
+  ||_||_|
+  ||_| _|
+         
+```
+
+Is converted to "123,456,789"
+## Source
+
+Inspired by the Bank OCR kata [http://codingdojo.org/cgi-bin/wiki.pl?KataBankOCR](http://codingdojo.org/cgi-bin/wiki.pl?KataBankOCR)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/perl5/exercises/palindrome-products/README.md

@@ -0,0 +1,40 @@
+# Palindrome Products
+
+Detect palindrome products in a given range.
+
+A palindromic number is a number that remains the same when its digits are
+reversed. For example, `121` is a palindromic number but `112` is not.
+
+Given the definition of a palindromic number, we define a palindrome _product_
+to be the product `c`, such that `a * b = c`, where `c` is a palindromic number and
+ `a` and `b` are integers (possibly, but _not_ necessarily palindromic numbers).
+
+For example, the palindromic number 9009 can be written as the palindrome
+product: `91 * 99 = 9009`.
+
+It's possible (and indeed common) for a palindrome product to be the product
+of multiple combinations of numbers. For example, the palindrome product `9` has
+the factors `(1, 9)`, `(3, 3)`, and `(9, 1)`.
+
+Write a program that given a range of integers, returns the smallest and largest
+palindromic product within that range, along with all of it's factors.
+
+## Example 1
+
+Given the range `[1, 9]` (both inclusive)...
+
+The smallest product is `1`. It's factors are `(1, 1)`.
+The largest product is `9`. It's factors are `(1, 9)`, `(3, 3)`, and `(9, 1)`.
+
+## Example 2
+
+Given the range `[10, 99]` (both inclusive)...
+
+The smallest palindrome product is `121`. It's factors are `(11, 11)`.
+The largest palindrome product is `9009`. It's factors are `(91, 99)` and `(99, 91)`.
+## Source
+
+Problem 4 at Project Euler [http://projecteuler.net/problem=4](http://projecteuler.net/problem=4)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/perl5/exercises/pascals-triangle/README.md

@@ -0,0 +1,21 @@
+# Pascals Triangle
+
+Compute Pascal's triangle up to a given number of rows.
+
+In Pascal's Triangle each number is computed by adding the numbers to
+the right and left of the current position in the previous row.
+
+```plain
+    1
+   1 1
+  1 2 1
+ 1 3 3 1
+1 4 6 4 1
+# ... etc
+```
+## Source
+
+Pascal's Triangle at Wolfram Math World [http://mathworld.wolfram.com/PascalsTriangle.html](http://mathworld.wolfram.com/PascalsTriangle.html)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/perl5/exercises/phone-number/Example.pm

@@ -1,32 +1,12 @@
-package Example;
-
+package PhoneNumber 2;
 use strict;
 use warnings;
 
-sub new {
-    my ($class, $number) = @_;
-    my $self = bless {} => $class;
-    $self->{number} = $self->_get_digits($number);
-
-    return $self;
-}
-sub _get_digits {
-    my ($self, $number) = @_;
-    my $digits = $number;
-    $digits =~ s/\D//g;
-    
-    return $digits if length $digits == 10;
-    return substr $digits, 1, 10 if $digits =~ m/1\d{10}/;
-    return "0" x 10;
+sub clean_number {
+  my ($number) = @_;
+  $number =~ s/\D//g;
+  return $number =~ /^ 1? ( (?: [2-9] \d{2} ){2} \d{4} ) $/x ? $1 : undef;
 }
 
-sub number { $_[0]->{number} }
-sub area_code { substr $_[0]->{number}, 0, 3 }
-
-sub pretty {
-    my $pretty = $_[0]->{number};
-    $pretty =~ s/(\d\d\d)(\d\d\d)(\d{4})/\($1\) $2\-$3/;
-    return $pretty;
-}
 
-__PACKAGE__;
+1;

data/tracks/perl5/exercises/phone-number/PhoneNumber.pm

@@ -0,0 +1,5 @@
+package PhoneNumber 2;
+use strict;
+use warnings;
+
+1;

data/tracks/perl5/exercises/phone-number/README.md

@@ -0,0 +1,34 @@
+# Phone Number
+
+Clean up user-entered phone numbers so that they can be sent SMS messages.
+
+The **North American Numbering Plan (NANP)** is a telephone numbering system used by many countries in North America like the United States, Canada or Bermuda. All NANP-countries share the same international country code: `1`.
+
+NANP numbers are ten-digit numbers consisting of a three-digit Numbering Plan Area code, commonly known as *area code*, followed by a seven-digit local number. The first three digits of the local number represent the *exchange code*, followed by the unique four-digit number which is the *subscriber number*.
+
+
+The format is usually represented as
+```
+(NXX)-NXX-XXXX
+```
+where `N` is any digit from 2 through 9 and `X` is any digit from 0 through 9.
+
+Your task is to clean up differently formated telephone numbers by removing punctuation and the country code (1) if present.
+
+For example, the inputs
+- `+1 (613)-995-0253`
+- `613-995-0253`
+- `1 613 995 0253`
+- `613.995.0253`
+
+should all produce the output
+
+`6139950253`
+
+**Note:** As this exercise only deals with telephone numbers used in NANP-countries, only 1 is considered a valid country code.
+## Source
+
+Event Manager by JumpstartLab [http://tutorials.jumpstartlab.com/projects/eventmanager.html](http://tutorials.jumpstartlab.com/projects/eventmanager.html)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/perl5/exercises/phone-number/example.yaml

@@ -0,0 +1,15 @@
+exercise: PhoneNumber
+version: 2
+plan: 15
+subs: clean_number
+tests: |-
+  foreach my $subcases (@{$C_DATA->{cases}}) {
+    is $subs{clean_number}->($_->{phrase}), $_->{expected}, $_->{description} foreach @{$subcases->{cases}};
+  }
+
+example: |
+  sub clean_number {
+    my ($number) = @_;
+    $number =~ s/\D//g;
+    return $number =~ /^ 1? ( (?: [2-9] \d{2} ){2} \d{4} ) $/x ? $1 : undef;
+  }

data/tracks/perl5/exercises/phone-number/phone-number.t

@@ -0,0 +1,138 @@
+#!/usr/bin/env perl
+use strict;
+use warnings;
+use FindBin;
+my $dir;
+use lib $dir = $FindBin::Bin;
+use JSON::PP;
+
+my $exercise = 'PhoneNumber';
+my $test_version = 2;
+my $module = $ENV{EXERCISM} ? 'Example' : $exercise;
+use Test::More tests => 15;
+
+use_ok $module or BAIL_OUT;
+
+my $exercise_version = $exercise->VERSION // 0;
+if ($exercise_version != $test_version) {
+  warn "\nExercise version mismatch. Further tests may fail!"
+    . "\n$exercise is v$exercise_version. "
+    . "Test is v$test_version.\n";
+  BAIL_OUT if $ENV{EXERCISM};
+}
+
+my %subs;
+foreach ( qw(clean_number) ) {
+  can_ok $exercise, $_;
+  $subs{$_} = $exercise->can($_);
+}
+
+my $C_DATA;
+foreach my $subcases (@{$C_DATA->{cases}}) {
+  is $subs{clean_number}->($_->{phrase}), $_->{expected}, $_->{description} foreach @{$subcases->{cases}};
+}
+
+SKIP: {
+  skip '', 1 unless $ENV{EXERCISM};
+  is_deeply eval q{
+    use Path::Tiny;
+    decode_json path("$dir/../../problem-specifications/exercises/".path($dir)->basename.'/canonical-data.json')->realpath->slurp;
+  }, $C_DATA, 'canonical-data';
+}
+
+done_testing;
+
+INIT {
+$C_DATA = decode_json <<'EOF';
+
+{
+  "exercise": "phone-number",
+  "version": "1.2.0",
+  "cases": [
+    {
+      "description": "Cleanup user-entered phone numbers",
+      "comments": [
+        " Returns the cleaned phone number if given number is valid, "
+      , " else returns nil. Note that number is not formatted,       "
+      , " just a 10-digit number is returned.                        "
+      ],
+      "cases": [
+        {
+          "description": "cleans the number",
+          "property": "clean",
+          "phrase": "(223) 456-7890",
+          "expected": "2234567890"
+        },
+        {
+          "description": "cleans numbers with dots",
+          "property": "clean",
+          "phrase": "223.456.7890",
+          "expected": "2234567890"
+        },
+        {
+          "description": "cleans numbers with multiple spaces",
+          "property": "clean",
+          "phrase": "223 456   7890   ",
+          "expected": "2234567890"
+        },
+        {
+          "description": "invalid when 9 digits",
+          "property": "clean",
+          "phrase": "123456789",
+          "expected": null
+        },
+        {
+          "description": "invalid when 11 digits does not start with a 1",
+          "property": "clean",
+          "phrase": "22234567890",
+          "expected": null
+        },
+        {
+          "description": "valid when 11 digits and starting with 1",
+          "property": "clean",
+          "phrase": "12234567890",
+          "expected": "2234567890"
+        },
+        {
+          "description": "valid when 11 digits and starting with 1 even with punctuation",
+          "property": "clean",
+          "phrase": "+1 (223) 456-7890",
+          "expected": "2234567890"
+        },
+        {
+          "description": "invalid when more than 11 digits",
+          "property": "clean",
+          "phrase": "321234567890",
+          "expected": null
+        },
+        {
+          "description": "invalid with letters",
+          "property": "clean",
+          "phrase": "123-abc-7890",
+          "expected": null
+        },
+        {
+          "description": "invalid with punctuations",
+          "property": "clean",
+          "phrase": "123-@:!-7890",
+          "expected": null
+        },
+        {
+          "description": "invalid if area code does not start with 2-9",
+          "property": "clean",
+          "phrase": "(123) 456-7890",
+          "expected": null
+        },
+        {
+          "description": "invalid if exchange code does not start with 2-9",
+          "property": "clean",
+          "phrase": "(223) 056-7890",
+          "expected": null
+        }
+      ]
+    }
+  ]
+}
+
+EOF
+}