trackler 2.2.1.91 → 2.2.1.92

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

@@ -3,14 +3,14 @@
 Search a file for lines matching a regular expression pattern. Return the line
 number and contents of each matching line.
 
-The Unix [`grep`](http://pubs.opengroup.org/onlinepubs/9699919799/utilities/grep.html) command can be used to search for lines in one or more files 
+The Unix [`grep`](http://pubs.opengroup.org/onlinepubs/9699919799/utilities/grep.html) command can be used to search for lines in one or more files
 that match a user-provided search query (known as the *pattern*).
 
 The `grep` command takes three arguments:
 
-1. The pattern used to match lines in a file. 
+1. The pattern used to match lines in a file.
 2. Zero or more flags to customize the matching behavior.
-3. One or more files in which to search for matching lines. 
+3. One or more files in which to search for matching lines.
 
 Your task is to implement the `grep` function, which should read the contents
 of the specified files, find the lines that match the specified pattern
@@ -20,18 +20,18 @@ in the first file being output first.
 
 As an example, suppose there is a file named "input.txt" with the following contents:
 
-<pre>
+```text
 hello
 world
 hello again
-</pre>
+```
 
 If we were to call `grep "hello" input.txt`, the returned string should be:
 
-<pre>
+```text
 hello
 hello again
-</pre>
+```
 
 ### Flags
 
@@ -46,18 +46,18 @@ As said earlier, the `grep` command should also support the following flags:
 If we run `grep -n "hello" input.txt`, the `-n` flag will require the matching
 lines to be prefixed with its line number:
 
-<pre>
+```text
 1:hello
 3:hello again
-</pre>
+```
 
-And if we run `grep -i "HELLO" input.txt`, we'll do a case-insensitive match, 
+And if we run `grep -i "HELLO" input.txt`, we'll do a case-insensitive match,
 and the output will be:
 
-<pre>
+```text
 hello
 hello again
-</pre>
+```
 
 The `grep` command should support multiple flags at once.
 
@@ -69,11 +69,9 @@ print the names of files that do not contain the string "hello".
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir grep_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/hamming/README.md

@@ -40,11 +40,9 @@ of equal length differently.
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir hamming_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/hello-world/README.md

@@ -22,6 +22,29 @@ Execute the tests with:
 $ elixir hello_world_test.exs
 ```
 
+### Pending tests
+
+In the test suites, all but the first test have been skipped.
+
+Once you get a test passing, you can unskip the next one by
+commenting out the relevant `@tag :pending` with a `#` symbol.
+
+For example:
+
+```elixir
+# @tag :pending
+test "shouting" do
+  assert Bob.hey("WATCH OUT!") == "Whoa, chill out!"
+end
+```
+
+Or, you can enable all the tests by commenting out the
+`ExUnit.configure` line in the test suite.
+
+```elixir
+# ExUnit.configure exclude: :pending, trace: true
+```
+
 For more detailed information about the Elixir track, please
 see the [help page](http://exercism.io/languages/elixir).
 

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

@@ -12,11 +12,9 @@ The program should handle invalid hexadecimal strings.
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir hexadecimal_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/isbn-verifier/README.md

@@ -1,42 +1,45 @@
-# ISBN-Verifier
+# ISBN Verifier
 
-Check if a given ISBN-10 is valid.
+The [ISBN-10 verification process](https://en.wikipedia.org/wiki/International_Standard_Book_Number) is used to validate book identification
+numbers. These normally contain dashes and look like: `3-598-21508-8`
 
-## Functionality
+## ISBN
 
-Given an unknown string the program should check if the provided string is a valid ISBN-10.
-Putting this into place requires some thinking about preprocessing/parsing of the string prior to calculating the check digit for the ISBN.
+The ISBN-10 format is 9 digits (0 to 9) plus one check character (either a digit or an X only). In the case the check character is an X, this represents the value '10'. These may be communicated with or without hyphens, and can be checked for their validity by the following formula:
 
-The program should allow for ISBN-10 without the separating dashes to be verified as well.
+```
+(x1 * 10 + x2 * 9 + x3 * 8 + x4 * 7 + x5 * 6 + x6 * 5 + x7 * 4 + x8 * 3 + x9 * 2 + x10 * 1) mod 11 == 0
+```
 
-## ISBN
+If the result is 0, then it is a valid ISBN-10, otherwise it is invalid.
+
+## Example
+
+Let's take the ISBN-10 `3-598-21508-8`. We plug it in to the formula, and get:
+```
+(3 * 10 + 5 * 9 + 9 * 8 + 8 * 7 + 2 * 6 + 1 * 5 + 5 * 4 + 0 * 3 + 8 * 2 + 8 * 1) mod 11 == 0
+```
 
-Let's take a random ISBN-10 number, say `3-598-21508-8` for this.
-The first digit block indicates the group where the ISBN belongs. Groups can consist of shared languages, geographic regions or countries. The leading '3' signals this ISBN is from a german speaking country.
-The following number block is to identify the publisher. Since this is a three digit publisher number there is a 5 digit title number for this book.
-The last digit in the ISBN is the check digit which is used to detect read errors.
+Since the result is 0, this proves that our ISBN is valid.
 
-The first 9 digits in the ISBN have to be between 0 and 9.
-The check digit can additionally be an 'X' to allow 10 to be a valid check digit as well.
+## Task
+
+Given a string the program should check if the provided string is a valid ISBN-10.
+Putting this into place requires some thinking about preprocessing/parsing of the string prior to calculating the check digit for the ISBN.
 
-A valid ISBN-10 is calculated with this formula `(x1 * 10 + x2 * 9 + x3 * 8 + x4 * 7 + x5 * 6 + x6 * 5 + x7 * 4 + x8 * 3 + x9 * 2 + x10 * 1) mod 11 == 0`
-So for our example ISBN this means:
-(3 * 10 + 5 * 9 + 9 * 8 + 8 * 7 + 2 * 6 + 1 * 5 + 5 * 4 + 0 * 3 + 8 * 2 + 8 * 1) mod 11 = 0
+The program should be able to verify ISBN-10 both with and without separating dashes.
 
-Which proves that the ISBN is valid.
 
 ## Caveats
 
-Converting from string to number can be tricky in certain languages.
-It's getting even trickier since the check-digit of an ISBN-10 can be 'X'.
+Converting from strings to numbers can be tricky in certain languages.
+Now, it's even trickier since the check digit of an ISBN-10 may be 'X' (representing '10'). For instance `3-598-21507-X` is a valid ISBN-10.
 
 ## Bonus tasks
 
-* Generate a valid ISBN-13 from the input ISBN-10 (and maybe verify it again with a derived verifier)
-
-* Generate valid ISBN, maybe even from a given starting ISBN
-
+* Generate a valid ISBN-13 from the input ISBN-10 (and maybe verify it again with a derived verifier).
 
+* Generate valid ISBN, maybe even from a given starting ISBN.
 ## Running tests
 
 Execute the tests with:
@@ -45,7 +48,6 @@ Execute the tests with:
 $ elixir isbn_verifier_test.exs
 ```
 
-
 ### Pending tests
 
 In the test suites, all but the first test have been skipped.

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

@@ -2,13 +2,14 @@
 
 Determine if a word or phrase is an isogram.
 
-An isogram (also known as a "nonpattern word") is a word or phrase without a repeating letter.
+An isogram (also known as a "nonpattern word") is a word or phrase without a repeating letter, however spaces and hyphens are allowed to appear multiple times.
 
 Examples of isograms:
 
 - lumberjacks
 - background
 - downstream
+- six-year-old
 
 The word *isograms*, however, is not an isogram, because the s repeats.
 
@@ -17,11 +18,9 @@ The word *isograms*, however, is not an isogram, because the s repeats.
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir isogram_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/kindergarten-garden/README.md

@@ -3,19 +3,19 @@
 Given a diagram, determine which plants each child in the kindergarten class is
 responsible for.
 
-The kindergarten class is learning about growing plants. The teachers
+The kindergarten class is learning about growing plants. The teacher
 thought it would be a good idea to give them actual seeds, plant them in
 actual dirt, and grow actual plants.
 
 They've chosen to grow grass, clover, radishes, and violets.
 
-To this end, they've put little styrofoam cups along the window sills,
-and planted one type of plant in each cup, choosing randomly from the
-available types of seeds.
+To this end, the children have put little cups along the window sills, and
+planted one type of plant in each cup, choosing randomly from the available
+types of seeds.
 
-```plain
+```text
 [window][window][window]
-........................ # each dot represents a styrofoam cup
+........................ # each dot represents a cup
 ........................
 ```
 
@@ -25,27 +25,27 @@ There are 12 children in the class:
 - Eve, Fred, Ginny, Harriet,
 - Ileana, Joseph, Kincaid, and Larry.
 
-Each child gets 4 cups, two on each row. The children are assigned to
-cups in alphabetical order.
+Each child gets 4 cups, two on each row. Their teacher assigns cups to
+the children alphabetically by their names.
 
 The following diagram represents Alice's plants:
 
-```plain
+```text
 [window][window][window]
 VR......................
 RG......................
 ```
 
-So in the row nearest the window, she has a violet and a radish; in the
-row behind that, she has a radish and some grass.
+In the first row, nearest the windows, she has a violet and a radish.  In the
+second row she has a radish and some grass.
 
 Your program will be given the plants from left-to-right starting with
 the row nearest the windows. From this, it should be able to determine
-which plants belong to which students.
+which plants belong to each student.
 
 For example, if it's told that the garden looks like so:
 
-```plain
+```text
 [window][window][window]
 VRCGVVRVCGGCCGVRGCVCGCGV
 VRCCCGCRRGVCGCRVVCVGCGCV
@@ -64,11 +64,9 @@ While asking for Bob's plants would yield:
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir kindergarten_garden_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/largest-series-product/README.md

@@ -18,11 +18,9 @@ the largest product for a series of 6 digits is 23520.
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir largest_series_product_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/leap/README.md

@@ -4,7 +4,7 @@ Given a year, report if it is a leap year.
 
 The tricky thing here is that a leap year in the Gregorian calendar occurs:
 
-```plain
+```text
 on every year that is evenly divisible by 4
   except every year that is evenly divisible by 100
     unless the year is also evenly divisible by 400
@@ -31,11 +31,9 @@ phenomenon, go watch [this youtube video][video].
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir leap_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/list-ops/README.md

@@ -11,11 +11,9 @@ without using existing functions.
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir list_ops_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.
@@ -42,6 +40,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/luhn/README.md

@@ -18,27 +18,27 @@ are disallowed.
 
 ## Example 1: valid credit card number
 
-```
+```text
 4539 1488 0343 6467
 ```
 
 The first step of the Luhn algorithm is to double every second digit,
 starting from the right. We will be doubling
 
-```
+```text
 4_3_ 1_8_ 0_4_ 6_6_
 ```
 
 If doubling the number results in a number greater than 9 then subtract 9
 from the product. The results of our doubling:
 
-```
+```text
 8569 2478 0383 3437
 ```
 
 Then sum all of the digits:
 
-```
+```text
 8+5+6+9+2+4+7+8+0+3+8+3+3+4+3+7 = 80
 ```
 
@@ -46,19 +46,19 @@ If the sum is evenly divisible by 10, then the number is valid. This number is v
 
 ## Example 2: invalid credit card number
 
-```
+```text
 8273 1232 7352 0569
 ```
 
 Double the second digits, starting from the right
 
-```
+```text
 7253 2262 5312 0539
 ```
 
 Sum the digits
 
-```
+```text
 7+2+5+3+2+2+6+2+5+3+1+2+0+5+3+9 = 57
 ```
 
@@ -69,11 +69,9 @@ Sum the digits
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir luhn_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/markdown/README.md

@@ -19,11 +19,9 @@ important thing is to make the code better!
 Execute the tests with:
 
 ```bash
-$ elixir bob_test.exs
+$ elixir markdown_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.
@@ -50,6 +48,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.