trackler 2.2.1.91 → 2.2.1.92

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

@@ -5,13 +5,15 @@ that matrix.
 
 So given a string with embedded newlines like:
 
-> 9 8 7  
-> 5 3 2  
-> 6 6 7  
+```text
+9 8 7
+5 3 2
+6 6 7
+```
 
 representing this matrix:
 
-```plain
+```text
     0  1  2
   |---------
 0 | 9  8  7
@@ -43,11 +45,9 @@ And its columns:
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir matrix_test.exs
 ```
 
-(Replace `bob_test.exs` with the name of the test file.)
-
 ### Pending tests
 
 In the test suites, all but the first test have been skipped.

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

@@ -2,37 +2,38 @@
 
 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.
+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
+- 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
+The descriptors you are expected to parse are:
+first, second, third, fourth, fifth, last, monteenth, tuesteenth, wednesteenth,
+thursteenth, friteenth, saturteenth, sunteenth
+
+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
- 
+Given examples of a meetup dates, each containing a month, day, year, and
+descriptor calculate the date of the actual meetup.  For example, if given
+"The first Monday of January 2017", the correct meetup date is 2017/1/2.
 
 ## Running tests
 
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir meetup_test.exs
 ```
 
-(Replace `bob_test.exs` with the name of the test file.)
-
 ### Pending tests
 
 In the test suites, all but the first test have been skipped.

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

@@ -31,11 +31,9 @@ into this:
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir minesweeper_test.exs
 ```
 
-(Replace `bob_test.exs` with the name of the test file.)
-
 ### Pending tests
 
 In the test suites, all but the first test have been skipped.
@@ -62,6 +60,5 @@ Or, you can enable all the tests by commenting out the
 For more detailed information about the Elixir track, please
 see the [help page](http://exercism.io/languages/elixir).
 
-
 ## Submitting Incomplete Solutions
 It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/elixir/exercises/nth-prime/README.md

@@ -13,11 +13,9 @@ numbers, pretend they don't exist and implement them yourself.
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir nth_prime_test.exs
 ```
 
-(Replace `bob_test.exs` with the name of the test file.)
-
 ### Pending tests
 
 In the test suites, all but the first test have been skipped.

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

@@ -1,41 +1,25 @@
 # Nucleotide Count
 
-Given a DNA string, compute how many times each nucleotide occurs in the string.
+Given a single stranded 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:
+The genetic language of every living thing on the planet is DNA.
+DNA is a large molecule that is built from an extremely long sequence of individual elements called nucleotides.
+4 types exist in DNA and these differ only slightly and can be represented as the following symbols: 'A' for adenine, 'C' for cytosine, 'G' for guanine, and 'T' thymine.
 
+Here is an analogy:
 - 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.
+- nucleotides are to DNA as
+- legos are to lego houses as
+- words are to sentences as...
 
 ## Running tests
 
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir nucleotide_count_test.exs
 ```
 
-(Replace `bob_test.exs` with the name of the test file.)
-
 ### Pending tests
 
 In the test suites, all but the first test have been skipped.

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

@@ -1,4 +1,4 @@
-# Ocr Numbers
+# OCR Numbers
 
 Given a 3 x 4 grid of pipes, underscores, and spaces, determine which number is
 represented, or whether it is garbled.
@@ -9,7 +9,7 @@ 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.
 
-```
+```text
      _   #
     | |  # zero.
     |_|  #
@@ -18,7 +18,7 @@ The binary font uses pipes and underscores, four rows high and three columns wid
 
 Is converted to "0"
 
-```
+```text
          #
       |  # one.
       |  #
@@ -39,7 +39,7 @@ Update your program to recognize multi-character binary strings, replacing garbl
 
 Update your program to recognize all numbers 0 through 9, both individually and as part of a larger string.
 
-```
+```text
  _ 
  _|
 |_ 
@@ -48,7 +48,7 @@ Update your program to recognize all numbers 0 through 9, both individually and
 
 Is converted to "2"
 
-```
+```text
       _  _     _  _  _  _  _  _  #
     | _| _||_||_ |_   ||_||_|| | # decimal numbers.
     ||_  _|  | _||_|  ||_| _||_| #
@@ -61,7 +61,7 @@ Is converted to "1234567890"
 
 Update your program to handle multiple numbers, one per line. When converting several lines, join the lines with commas.
 
-```
+```text
     _  _ 
   | _| _|
   ||_  _|
@@ -83,11 +83,9 @@ Is converted to "123,456,789"
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir ocr_numbers_test.exs
 ```
 
-(Replace `bob_test.exs` with the name of the test file.)
-
 ### Pending tests
 
 In the test suites, all but the first test have been skipped.

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

@@ -5,44 +5,41 @@ 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).
+Given a range of numbers, find the largest and smallest palindromes which
+are products of numbers within that range.
 
-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.
+Your solution should return the largest and smallest palindromes, along with the
+factors of each within the range. If the largest or smallest palindrome has more
+than one pair of factors within the range, then return all the pairs.
 
 ## 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)`.
+And given the list of all possible products within this range:
+`[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 16, 18, 15, 21, 24, 27, 20, 28, 32, 36, 25, 30, 35, 40, 45, 42, 48, 54, 49, 56, 63, 64, 72, 81]`
+
+The palindrome products are all single digit numbers (in this case):
+`[1, 2, 3, 4, 5, 6, 7, 8, 9]`
+
+The smallest palindrome product is `1`. Its factors are `(1, 1)`.
+The largest palindrome product is `9`. Its factors are `(1, 9)` and `(3, 3)`.
 
 ## 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)`.
+The smallest palindrome product is `121`. Its factors are `(11, 11)`.
+The largest palindrome product is `9009`. Its factors are `(91, 99)`.
 
 ## Running tests
 
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir palindrome_products_test.exs
 ```
 
-(Replace `bob_test.exs` with the name of the test file.)
-
 ### Pending tests
 
 In the test suites, all but the first test have been skipped.

data/tracks/elixir/exercises/pangram/README.md

@@ -2,7 +2,7 @@
 
 Determine if a sentence is a pangram. A pangram (Greek: παν γράμμα, pan gramma,
 "every letter") is a sentence using every letter of the alphabet at least once.
-The best known English pangram is: 
+The best known English pangram is:
 > The quick brown fox jumps over the lazy dog.
 
 The alphabet used consists of ASCII letters `a` to `z`, inclusive, and is case
@@ -13,11 +13,9 @@ insensitive. Input will not contain non-ASCII symbols.
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir pangram_test.exs
 ```
 
-(Replace `bob_test.exs` with the name of the test file.)
-
 ### Pending tests
 
 In the test suites, all but the first test have been skipped.

data/tracks/elixir/exercises/parallel-letter-frequency/README.md

@@ -12,11 +12,9 @@ list of texts and that employs parallelism.
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir parallel_letter_frequency_test.exs
 ```
 
-(Replace `bob_test.exs` with the name of the test file.)
-
 ### Pending tests
 
 In the test suites, all but the first test have been skipped.
@@ -43,6 +41,5 @@ Or, you can enable all the tests by commenting out the
 For more detailed information about the Elixir track, please
 see the [help page](http://exercism.io/languages/elixir).
 
-
 ## Submitting Incomplete Solutions
 It's possible to submit an incomplete solution so you can see how others have completed the exercise.

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

@@ -1,11 +1,11 @@
-# Pascals Triangle
+# Pascal's 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
+```text
     1
    1 1
   1 2 1
@@ -19,11 +19,9 @@ the right and left of the current position in the previous row.
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir pascals_triangle_test.exs
 ```
 
-(Replace `bob_test.exs` with the name of the test file.)
-
 ### Pending tests
 
 In the test suites, all but the first test have been skipped.

data/tracks/elixir/exercises/perfect-numbers/README.md

@@ -5,7 +5,7 @@ Nicomachus' (60 - 120 CE) classification scheme for natural numbers.
 
 The Greek mathematician [Nicomachus](https://en.wikipedia.org/wiki/Nicomachus) devised a classification scheme for natural numbers, identifying each as belonging uniquely to the categories of **perfect**, **abundant**, or **deficient** based on their [aliquot sum](https://en.wikipedia.org/wiki/Aliquot_sum). The aliquot sum is defined as the sum of the factors of a number not including the number itself. For example, the aliquot sum of 15 is (1 + 3 + 5) = 9
 
-- **Perfect**: aliquot sum = number 
+- **Perfect**: aliquot sum = number
   - 6 is a perfect number because (1 + 2 + 3) = 6
   - 28 is a perfect number because (1 + 2 + 4 + 7 + 14) = 28
 - **Abundant**: aliquot sum > number
@@ -14,7 +14,7 @@ The Greek mathematician [Nicomachus](https://en.wikipedia.org/wiki/Nicomachus) d
 - **Deficient**: aliquot sum < number
   - 8 is a deficient number because (1 + 2 + 4) = 7
   - Prime numbers are deficient
-  
+
 Implement a way to determine whether a given number is **perfect**. Depending on your language track, you may also need to implement a way to determine whether a given number is **abundant** or **deficient**.
 
 ## Running tests
@@ -22,11 +22,9 @@ Implement a way to determine whether a given number is **perfect**. Depending on
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir perfect_numbers_test.exs
 ```
 
-(Replace `bob_test.exs` with the name of the test file.)
-
 ### Pending tests
 
 In the test suites, all but the first test have been skipped.

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

@@ -6,14 +6,15 @@ The **North American Numbering Plan (NANP)** is a telephone numbering system use
 
 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
-```
+
+```text
 (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.
+Your task is to clean up differently formatted telephone numbers by removing punctuation and the country code (1) if present.
 
 For example, the inputs
 - `+1 (613)-995-0253`
@@ -32,11 +33,9 @@ should all produce the output
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir phone_number_test.exs
 ```
 
-(Replace `bob_test.exs` with the name of the test file.)
-
 ### Pending tests
 
 In the test suites, all but the first test have been skipped.

data/tracks/elixir/exercises/pig-latin/README.md

@@ -22,11 +22,9 @@ See <http://en.wikipedia.org/wiki/Pig_latin> for more details.
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir pig_latin_test.exs
 ```
 
-(Replace `bob_test.exs` with the name of the test file.)
-
 ### Pending tests
 
 In the test suites, all but the first test have been skipped.