trackler 2.2.1.110 → 2.2.1.111

data/tracks/ecmascript/exercises/spiral-matrix/README.md

@@ -1,4 +1,4 @@
-# Spiral matrix
+# Spiral Matrix
 
 Given the size, return a square matrix of numbers in spiral order.
 
@@ -28,7 +28,7 @@ like these examples:
 Go through the setup instructions for ECMAScript to
 install the necessary dependencies:
 
-http://exercism.io/languages/ecmascript/installation
+http://exercism.io/languages/ecmascript
 
 ## Requirements
 
@@ -51,9 +51,10 @@ In the test suites all tests but the first have been skipped.
 Once you get a test passing, you can enable the next one by
 changing `xtest` to `test`.
 
+
 ## Source
 
-Reddit [Reddit r/dailyprogrammer challenge #320 [Easy] Spiral Ascension.](https://www.reddit.com/r/dailyprogrammer/comments/6i60lr/20170619_challenge_320_easy_spiral_ascension/)
+Reddit r/dailyprogrammer challenge #320 [Easy] Spiral Ascension. [https://www.reddit.com/r/dailyprogrammer/comments/6i60lr/20170619_challenge_320_easy_spiral_ascension/](https://www.reddit.com/r/dailyprogrammer/comments/6i60lr/20170619_challenge_320_easy_spiral_ascension/)
 
 ## Submitting Incomplete Solutions
 It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/ecmascript/exercises/strain/README.md

@@ -38,7 +38,7 @@ basic tools instead.
 Go through the setup instructions for ECMAScript to
 install the necessary dependencies:
 
-http://exercism.io/languages/ecmascript/installation
+http://exercism.io/languages/ecmascript
 
 ## Requirements
 

data/tracks/ecmascript/exercises/sublist/README.md

@@ -22,7 +22,7 @@ Examples:
 Go through the setup instructions for ECMAScript to
 install the necessary dependencies:
 
-http://exercism.io/languages/ecmascript/installation
+http://exercism.io/languages/ecmascript
 
 ## Requirements
 

data/tracks/ecmascript/exercises/sum-of-multiples/README.md

@@ -1,22 +1,19 @@
 # Sum Of Multiples
 
-Given a number, find the sum of all the multiples of particular numbers up to
+Given a number, find the sum of all the unique multiples of particular numbers up to
 but not including that number.
 
-If we list all the natural numbers up to but not including 20 that are
-multiples of either 3 or 5, we get 3, 5, 6 and 9, 10, 12, 15, and 18.
+If we list all the natural numbers below 20 that are multiples of 3 or 5,
+we get 3, 5, 6, 9, 10, 12, 15, and 18.
 
 The sum of these multiples is 78.
 
-Given a number, find the sum of the multiples of a given set of numbers,
-up to but not including that number.
-
 ## Setup
 
 Go through the setup instructions for ECMAScript to
 install the necessary dependencies:
 
-http://exercism.io/languages/ecmascript/installation
+http://exercism.io/languages/ecmascript
 
 ## Requirements
 

data/tracks/ecmascript/exercises/transpose/README.md

@@ -73,7 +73,7 @@ Install assignment dependencies:
 $ npm install
 ```
 
-## Making the Test Suite Pass
+## Making the test suite pass
 
 Execute the tests with:
 
@@ -81,11 +81,12 @@ Execute the tests with:
 $ npm test
 ```
 
-In the test suite, all tests but the first have been skipped.
+In the test suites all tests but the first have been skipped.
 
 Once you get a test passing, you can enable the next one by
 changing `xtest` to `test`.
 
+
 ## Source
 
 Reddit r/dailyprogrammer challenge #270 [Easy]. [https://www.reddit.com/r/dailyprogrammer/comments/4msu2x/challenge_270_easy_transpose_the_input_text](https://www.reddit.com/r/dailyprogrammer/comments/4msu2x/challenge_270_easy_transpose_the_input_text)

data/tracks/ecmascript/exercises/triangle/README.md

@@ -2,29 +2,32 @@
 
 Determine if a triangle is equilateral, isosceles, or scalene.
 
-An _equilateral_ triangle has all three sides the same length.<br/>
+An _equilateral_ triangle has all three sides the same length.
+
 An _isosceles_ triangle has at least two sides the same length. (It is sometimes
 specified as having exactly two sides the same length, but for the purposes of
-this exercise we'll say at least two.)<br/>
+this exercise we'll say at least two.)
+
 A _scalene_ triangle has all sides of different lengths.
 
 ## Note
 
-For a shape to be a triangle at all, all sides have to be of length > 0, and 
-the sum of the lengths of any two sides must be greater than or equal to the 
+For a shape to be a triangle at all, all sides have to be of length > 0, and
+the sum of the lengths of any two sides must be greater than or equal to the
 length of the third side. See [Triangle Inequality](https://en.wikipedia.org/wiki/Triangle_inequality).
 
 ## Dig Deeper
 
-The case where the sum of the lengths of two sides _equals_ that of the 
-third is known as a _degenerate_ triangle - it has zero area and looks like 
+The case where the sum of the lengths of two sides _equals_ that of the
+third is known as a _degenerate_ triangle - it has zero area and looks like
 a single line. Feel free to add your own code/tests to check for degenerate triangles.
+
 ## Setup
 
 Go through the setup instructions for ECMAScript to
 install the necessary dependencies:
 
-http://exercism.io/languages/ecmascript/installation
+http://exercism.io/languages/ecmascript
 
 ## Requirements
 

data/tracks/ecmascript/exercises/trinary/README.md

@@ -11,7 +11,7 @@ Trinary numbers contain three symbols: 0, 1, and 2.
 The last place in a trinary number is the 1's place. The second to last
 is the 3's place, the third to last is the 9's place, etc.
 
-```bash
+```shell
 # "102012"
     1       0       2       0       1       2    # the number
 1*3^5 + 0*3^4 + 2*3^3 + 0*3^2 + 1*3^1 + 2*3^0    # the value
@@ -26,7 +26,7 @@ conversion, pretend it doesn't exist and implement it yourself.
 Go through the setup instructions for ECMAScript to
 install the necessary dependencies:
 
-http://exercism.io/languages/ecmascript/installation
+http://exercism.io/languages/ecmascript
 
 ## Requirements
 

data/tracks/ecmascript/exercises/twelve-days/README.md

@@ -2,7 +2,7 @@
 
 Output the lyrics to 'The Twelve Days of Christmas'.
 
-```
+```text
 On the first day of Christmas my true love gave to me, a Partridge in a Pear Tree.
 
 On the second day of Christmas my true love gave to me, two Turtle Doves, and a Partridge in a Pear Tree.
@@ -28,13 +28,12 @@ On the eleventh day of Christmas my true love gave to me, eleven Pipers Piping,
 On the twelfth day of Christmas my true love gave to me, twelve Drummers Drumming, eleven Pipers Piping, ten Lords-a-Leaping, nine Ladies Dancing, eight Maids-a-Milking, seven Swans-a-Swimming, six Geese-a-Laying, five Gold Rings, four Calling Birds, three French Hens, two Turtle Doves, and a Partridge in a Pear Tree.
 ```
 
-
 ## Setup
 
 Go through the setup instructions for ECMAScript to
 install the necessary dependencies:
 
-http://exercism.io/languages/ecmascript/installation
+http://exercism.io/languages/ecmascript
 
 ## Requirements
 
@@ -63,4 +62,4 @@ changing `xtest` to `test`.
 Wikipedia [http://en.wikipedia.org/wiki/The_Twelve_Days_of_Christmas_(song)](http://en.wikipedia.org/wiki/The_Twelve_Days_of_Christmas_(song))
 
 ## Submitting Incomplete Solutions
-It's possible to submit an incomplete solution so you can see how others have completed the exercise.
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/ecmascript/exercises/two-bucket/README.md

@@ -4,22 +4,22 @@ Given two buckets of different size, demonstrate how to measure an exact number
 
 Since this mathematical problem is fairly subject to interpretation / individual approach, the tests have been written specifically to expect one overarching solution.
 
-To help, the tests provide you with which bucket to fill first. That means, when starting with the larger bucket full, you are NOT allowed at any point to have the smaller bucket full and the larger bucket empty (aka, the opposite starting point); that would defeat the purpose of comparing both approaches! 
+To help, the tests provide you with which bucket to fill first. That means, when starting with the larger bucket full, you are NOT allowed at any point to have the smaller bucket full and the larger bucket empty (aka, the opposite starting point); that would defeat the purpose of comparing both approaches!
 
 Your program will take as input:
-- the size of bucket one, passed as a numeric value
-- the size of bucket two, passed as a numeric value
-- the desired number of liters to reach, passed as a numeric value
-- which bucket to fill first, passed as a String (either 'one' or 'two')
+- the size of bucket one
+- the size of bucket two
+- the desired number of liters to reach
+- which bucket to fill first, either bucket one or bucket two
 
 Your program should determine:
-- the total number of "moves" it should take to reach the desired number of liters, including the first fill - expects a numeric value
-- which bucket should end up with the desired number of liters (let's say this is bucket A) - expects a String (either 'one' or 'two')
-- how many liters are left in the other bucket (bucket B) - expects a numeric value
+- the total number of "moves" it should take to reach the desired number of liters, including the first fill
+- which bucket should end up with the desired number of liters (let's say this is bucket A) - either bucket one or bucket two
+- how many liters are left in the other bucket (bucket B)
 
-Note: any time a change is made to either or both buckets counts as one (1) move. 
+Note: any time a change is made to either or both buckets counts as one (1) move.
 
-Example: 
+Example:
 Bucket one can hold up to 7 liters, and bucket two can hold up to 11 liters. Let's say bucket one, at a given step, is holding 7 liters, and bucket two is holding 8 liters (7,8). If you empty bucket one and make no change to bucket two, leaving you with 0 liters and 8 liters respectively (0,8), that counts as one "move". Instead, if you had poured from bucket one into bucket two until bucket two was full, leaving you with 4 liters in bucket one and 11 liters in bucket two (4,11), that would count as only one "move" as well.
 
 To conclude, the only valid moves are:
@@ -34,7 +34,7 @@ Written with <3 at [Fullstack Academy](http://www.fullstackacademy.com/) by [Lin
 Go through the setup instructions for ECMAScript to
 install the necessary dependencies:
 
-http://exercism.io/languages/ecmascript/installation
+http://exercism.io/languages/ecmascript
 
 ## Requirements
 

data/tracks/ecmascript/exercises/two-fer/README.md

@@ -1,23 +1,23 @@
 # Two Fer
 
-Create a sentence of the form "One for X, one for me."
-
 `Two-fer` or `2-fer` is short for two for one. One for you and one for me.
 
-```plain
+```text
 "One for X, one for me."
 ```
 
 When X is a name or "you".
 
-If the given name is "Alice", the result should be "One for Alice, one for me." If no name is given, the result should be "One for you, one for me."
+If the given name is "Alice", the result should be "One for Alice, one for me."
+If no name is given, the result should be "One for you, one for me."
+
 
 ## Setup
 
 Go through the setup instructions for ECMAScript to
 install the necessary dependencies:
 
-http://exercism.io/languages/ecmascript/installation
+http://exercism.io/languages/ecmascript
 
 ## Requirements
 
@@ -40,8 +40,10 @@ In the test suites all tests but the first have been skipped.
 Once you get a test passing, you can enable the next one by
 changing `xtest` to `test`.
 
+
 ## Source
-This is an exercise to introduce users to basic programming constructs, just after Hello World. [https://en.wikipedia.org/wiki/Two-fer](https://en.wikipedia.org/wiki/Two-fer)
+
+[https://en.wikipedia.org/wiki/Two-fer](https://en.wikipedia.org/wiki/Two-fer)
 
 ## Submitting Incomplete Solutions
 It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/ecmascript/exercises/word-count/README.md

@@ -4,20 +4,19 @@ Given a phrase, count the occurrences of each word in that phrase.
 
 For example for the input `"olly olly in come free"`
 
-```plain
+```text
 olly: 2
 in: 1
 come: 1
 free: 1
 ```
 
-
 ## Setup
 
 Go through the setup instructions for ECMAScript to
 install the necessary dependencies:
 
-http://exercism.io/languages/ecmascript/installation
+http://exercism.io/languages/ecmascript
 
 ## Requirements
 

data/tracks/ecmascript/exercises/word-search/README.md

@@ -31,7 +31,7 @@ letter of each word.
 Go through the setup instructions for ECMAScript to
 install the necessary dependencies:
 
-http://exercism.io/languages/ecmascript/installation
+http://exercism.io/languages/ecmascript
 
 ## Requirements
 
@@ -54,5 +54,6 @@ In the test suites all tests but the first have been skipped.
 Once you get a test passing, you can enable the next one by
 changing `xtest` to `test`.
 
+
 ## Submitting Incomplete Solutions
 It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/ecmascript/exercises/wordy/README.md

@@ -2,7 +2,6 @@
 
 Parse and evaluate simple math word problems returning the answer as an integer.
 
-
 ## Iteration 1 — Addition
 
 Add two numbers together.
@@ -13,7 +12,6 @@ Evaluates to 18.
 
 Handle large numbers and negative numbers.
 
-
 ## Iteration 2 — Subtraction, Multiplication and Division
 
 Now, perform the other three operations.
@@ -30,7 +28,6 @@ Now, perform the other three operations.
 
 5
 
-
 ## Iteration 3 — Multiple Operations
 
 Handle a set of operations, in sequence.
@@ -46,7 +43,6 @@ left-to-right, _ignoring the typical order of operations._
 
 15  (i.e. not 9)
 
-
 ## Bonus — Exponentials
 
 If you'd like, handle exponentials.
@@ -55,13 +51,12 @@ If you'd like, handle exponentials.
 
 32
 
-
 ## Setup
 
 Go through the setup instructions for ECMAScript to
 install the necessary dependencies:
 
-http://exercism.io/languages/ecmascript/installation
+http://exercism.io/languages/ecmascript
 
 ## Requirements
 

data/tracks/elixir/exercises/bob/bob_test.exs

@@ -34,7 +34,7 @@ defmodule BobTest do
 
   @tag :pending
   test "asking in capitals" do
-    assert Bob.hey("THIS ISN'T SHOUTING?") == "Sure."
+    assert Bob.hey("THIS ISN'T SHOUTING?") == "Calm down, I know what I'm doing!"
   end
 
   @tag :pending

data/tracks/elixir/exercises/bob/example.exs

@@ -20,6 +20,7 @@ defmodule Bob do
   def hey(input) do
     cond do
       silent?(input) -> "Fine. Be that way!"
+      shouting_question?(input) -> "Calm down, I know what I'm doing!"
       question?(input) -> "Sure."
       shouting?(input) -> "Whoa, chill out!"
       true -> "Whatever."
@@ -29,6 +30,7 @@ defmodule Bob do
   defp silent?(input), do: "" == String.trim(input)
   defp shouting?(input), do: input == String.upcase(input) && letters?(input)
   defp question?(input), do: String.ends_with?(input, "?")
+  defp shouting_question?(input), do: shouting?(input) && question?(input)
   defp letters?(input), do: Regex.match?(~r/\p{L}+/, input)
 end
 
@@ -38,21 +40,23 @@ end
 # warning)
 
 # defmodule Message do
-#   def silent?(input),   do: "" == String.strip(input)
-#   def shouting?(input), do: input == String.upcase(input) && letters?(input)
-#   def question?(input), do: String.ends_with?(input, "?")
-#   defp letters?(input), do: Regex.match?(~r/\p{L}+/, input)
+#   def silent?(input),            do: "" == String.strip(input)
+#   def shouting_question?(input), do: shouting?(input) && question?(input)
+#   def shouting?(input),          do: input == String.upcase(input) && letters?(input)
+#   def question?(input),          do: String.ends_with?(input, "?")
+#   defp letters?(input),          do: Regex.match?(~r/\p{L}+/, input)
 # end
 #
 # defmodule Bob do
-#   import Message, only: [silent?: 1, shouting?: 1, question?: 1]
+#   import Message, only: [silent?: 1, shouting_question?: 1, shouting?: 1, question?: 1]
 #
 #   def hey(input) do
 #     cond do
-#       silent?(input)   -> "Fine. Be that way!"
-#       shouting?(input) -> "Whoa, chill out!"
-#       question?(input) -> "Sure."
-#       true             -> "Whatever."
+#       silent?(input)            -> "Fine. Be that way!"
+#       shouting_question?(input) -> "Calm down, I know what I'm doing!"
+#       shouting?(input)          -> "Whoa, chill out!"
+#       question?(input)          -> "Sure."
+#       true                      -> "Whatever."
 #     end
 #   end
 # end

data/tracks/elm/config.json

@@ -22,6 +22,15 @@
 
       ]
     },
+    {
+      "uuid": "50770287-c734-46ba-b3a1-c36d31b6cc3c",
+      "slug": "twelve-days",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 1,
+      "topics": [
+      ]
+    },
     {
       "uuid": "e943e3bf-920e-4541-95c3-be7bf6024afe",
       "slug": "leap",
@@ -332,6 +341,16 @@
 
       ]
     },
+    {
+      "uuid": "851ddd78-13a0-4d8f-adda-41abde670687",
+      "slug": "acronym",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 1,
+      "topics": [
+
+      ]
+    },
     {
       "uuid": "bdb8364b-d8b2-4d58-a824-1035cddedb42",
       "slug": "all-your-base",
@@ -363,6 +382,15 @@
         "Lists"
       ]
     },
+    {
+      "uuid": "39464d44-1475-47c1-8f08-2aba9e6b2d85",
+      "slug": "luhn",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 5,
+      "topics": [
+      ]
+    },
     {
       "uuid": "1F9FE5BC-8213-44FD-B7D1-5D4CC7F3A475",
       "slug": "binary-search",