trackler 2.2.1.13 → 2.2.1.14

data/tracks/kotlin/exercises/space-age/README.md

@@ -12,12 +12,13 @@ Given an age in seconds, calculate how old someone would be on:
    - Neptune: orbital period 164.79132 Earth years
 
 So if you were told someone were 1,000,000,000 seconds old, you should
-be able to say that they're 31 Earth-years old.
+be able to say that they're 31.69 Earth-years old. Round all ages to
+the nearest hundredth of a year.
 
 If you're wondering why Pluto didn't make the cut, go watch [this
 youtube video](http://www.youtube.com/watch?v=Z_2gbGXzFbs).
 
-
+
 
 ## Source
 

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

@@ -23,7 +23,7 @@ like these examples:
 10  9  8 7
 ```
 
-
+
 
 ## Source
 

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

@@ -33,7 +33,7 @@ Keep your hands off that filter/reject/whatchamacallit functionality
 provided by your standard library!  Solve this one yourself using other
 basic tools instead.
 
-
+
 
 ## Source
 

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

@@ -17,7 +17,7 @@ Examples:
  * A = [1, 2, 3, 4, 5], B = [2, 3, 4], A is a superlist of B
  * A = [1, 2, 4], B = [1, 2, 3, 4, 5], A is not a superlist of, sublist of or equal to B
 
-
+
 
 
 ## Submitting Incomplete Solutions

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

@@ -11,7 +11,7 @@ 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.
 
-
+
 
 ## Source
 

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

@@ -19,7 +19,7 @@ length of the third side. See [Triangle Inequality](https://en.wikipedia.org/wik
 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.
-
+
 
 ## Source
 

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

@@ -12,7 +12,7 @@ free: 1
 ```
 
 
-
+
 
 ## Source
 

data/tracks/pony/exercises/atbash-cipher/example.pony

@@ -18,7 +18,7 @@ primitive Atbash
       last.push(c)
     else
       last.push(' ')
-      groups.push(String(6).>push(c))
+      groups.push(String(6) .> push(c))
     end
     groups
 
@@ -27,8 +27,9 @@ primitive Atbash
       String.join(
         Iter[U8](input.lower().values())
           .filter(this~_transposable())
-          .map[U8]({(c: U8): U8 => Atbash._transpose(c)})
-          .fold[Array[String ref]](this~_group(), [String(6)])?)
+          .map[U8]({(c: U8): U8 => Atbash._transpose(c) })
+          .fold[Array[String ref]](this~_group(), [String(6)])?
+          .values())
     else
       recover String end
     end

data/tracks/pony/exercises/beer-song/example.pony

@@ -23,12 +23,12 @@ primitive BeerSong
       let ns: String = n.string()
       let ns': String = (n - 1).string()
       recover String
-        .>append(ns)
-        .>append(" bottles of beer on the wall, ")
-        .>append(ns)
-        .>append(" bottles of beer.\nTake one down and pass it around, ")
-        .>append(ns')
-        .>append(" bottles of beer on the wall.\n")
+        .> append(ns)
+        .> append(" bottles of beer on the wall, ")
+        .> append(ns)
+        .> append(" bottles of beer.\nTake one down and pass it around, ")
+        .> append(ns')
+        .> append(" bottles of beer on the wall.\n")
       end
     end
 
@@ -36,9 +36,10 @@ primitive BeerSong
     try
       String.join(
         Iter[USize](Reverse(start, stop))
-          .map[String]({(n: USize): String => BeerSong.verse(n) + "\n"})
-          .collect(Array[String](start - stop)))
-        .>pop()?
+          .map[String]({(n: USize): String => BeerSong.verse(n) + "\n" })
+          .collect(Array[String](start - stop))
+          .values())
+        .> pop()?
     else
       recover String end
     end

data/tracks/pony/exercises/bob/example.pony

@@ -13,7 +13,7 @@ primitive Bob
     end
 
   fun _silent(phrase: String): Bool =>
-    phrase.clone().>strip() == ""
+    phrase.clone() .> strip() == ""
 
   fun _loud(phrase: String): Bool =>
     Iter[U8](phrase.values()).all(this~_not_lowercase())

data/tracks/pony/exercises/difference-of-squares/example.pony

@@ -9,8 +9,8 @@ primitive Squares
   fun sum_of_squares(n: USize): USize =>
     try
       Iter[USize](Range(0, n + 1))
-        .map[USize]({(x: USize): USize => x * x})
-        .fold[USize]({(acc: USize, x: USize): USize => acc + x}, 0)?
+        .map[USize]({(x: USize): USize => x * x })
+        .fold[USize]({(acc: USize, x: USize): USize => acc + x }, 0)?
     else
       0
     end

data/tracks/pony/exercises/hamming/example.pony

@@ -7,5 +7,5 @@ primitive HammingDistance
     
     Iter[U8](strand1.values())
       .zip[U8](strand2.values())
-      .filter({(t: (U8, U8)): Bool => t._1 != t._2})
+      .filter({(t: (U8, U8)): Bool => t._1 != t._2 })
       .count()

data/tracks/pony/exercises/hamming/test.pony

@@ -22,5 +22,5 @@ class iso _TestHammingDistance is UnitTest
     h.assert_eq[USize](4, HammingDistance("GATACA", "GCATAA")?)
     h.assert_eq[USize](9, HammingDistance("GGACGGATTCTG", "AGGACGGATTCT")?)
 
-    h.assert_error({()? => HammingDistance("GAT", "GA")?})
-    h.assert_error({()? => HammingDistance("GA", "GAC")?})
+    h.assert_error({()? => HammingDistance("GAT", "GA")? })
+    h.assert_error({()? => HammingDistance("GA", "GAC")? })

data/tracks/pony/exercises/leap/example.pony

@@ -1,4 +1,4 @@
 primitive Leap
   fun apply(year: USize): Bool =>
-    let has_factor = {(n: USize)(year): Bool => (year % n) == 0}
+    let has_factor = {(n: USize)(year): Bool => (year % n) == 0 }
     has_factor(4) and (not has_factor(100) or has_factor(400))

data/tracks/pony/exercises/pascals-triangle/example.pony

@@ -4,11 +4,11 @@ use "itertools"
 primitive PascalsTriangle
   fun rows(count: USize): Array[Array[USize]] =>
     Iter[USize](Range(0, count))
-      .map[Array[USize]]({(n: USize): Array[USize] => PascalsTriangle.row(n)})
+      .map[Array[USize]]({(n: USize): Array[USize] => PascalsTriangle.row(n) })
       .collect(Array[Array[USize]](count))
 
   fun row(n: USize): Array[USize] =>
-    let r = Array[USize](n).>push(1)
+    let r = Array[USize](n) .> push(1)
     for i in Range(1, n + 1) do
       try
         let last = r(i - 1)?

data/tracks/pony/exercises/rna-transcription/test.pony

@@ -28,5 +28,5 @@ class iso _TestRNATrancription is UnitTest
       h.assert_eq[String](ToRNA(input)?, expected)
     end
 
-    h.assert_error({() ? => ToRNA("U")?})
-    h.assert_error({() ? => ToRNA("ACGTXXXCTTAA")?})
+    h.assert_error({() ? => ToRNA("U")? })
+    h.assert_error({() ? => ToRNA("ACGTXXXCTTAA")? })

data/tracks/pony/exercises/roman-numerals/test.pony

@@ -41,5 +41,5 @@ class iso _TestRomanNumerals is UnitTest
       end
     end
 
-    h.assert_error({() ? => RomanNumerals(-1)?})
-    h.assert_error({() ? => RomanNumerals(4000)?})
+    h.assert_error({() ? => RomanNumerals(-1)? })
+    h.assert_error({() ? => RomanNumerals(4000)? })

data/tracks/python/config.json

@@ -801,6 +801,28 @@
         "Algorithms"
       ]
     },
+    {
+      "uuid": "bacb2184-025f-0980-38d6-34fb419e03a6d3d8b44",
+      "slug": "two-fer",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 1,
+      "topics": [
+        "control-flow (if-else statements)",
+        "optional values",
+        "text formatting"
+      ]
+    },
+    {
+      "uuid": "33f689ee-1d9c-4908-a71c-f84bff3510df",
+      "slug": "collatz-conjecture",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 1,
+      "topics": [
+            "control-flow (loops)"
+      ]
+    },
     {
       "uuid": "e7351e8e-d3ff-4621-b818-cd55cf05bffd",
       "slug": "accumulate",

data/tracks/python/docs/ABOUT.md

@@ -1,7 +1,15 @@
-Python is a strong language for beginners. There are many resources available for programmers of all levels, the code is highly readable, and in many cases phrases are comparable to those in the English language. Code can be written and executed from the command line, in an interactive IPython session, or in a [Jupyter](http://jupyter.org) (IPython) notebook.
+Python is a strong language for beginners. 
+There are many resources available for programmers of all levels, the code is highly readable, and in many cases phrases are comparable to those in the English language.
+Code can be written and executed from the command line, in an interactive IPython session, or in a [Jupyter](http://jupyter.org) (IPython) notebook.
 
-The most common form of Python is compiled in C. This is often invisible to the beginning programmer, but if there are uses for which exceptionally fast implementation is needed then C extensions can be written to optimize Python execution.
+The most common form of Python is compiled in C.
+This is often invisible to the beginning programmer, but if there are uses for which exceptionally fast implementation is needed then C extensions can be written to optimize Python execution.
 
 [Python is used extensively](https://www.python.org/about/apps/) in scientific computing, finance, games, networking, internet development, and in assembling pipelines of other programs.
 
-Python was started by Guido van Rossum in 1989. Its name is an homage to the comedy troupe Monty Python. Python 2 is used widely but support may end by 2020. Python 3 was introduced in 2008 and is beginning to be adopted more widely. They are similar, but users will encounter [some differences](http://blog.teamtreehouse.com/python-2-vs-python-3). Python development is shepherded by [The Python Software Foundation](https://www.python.org/about/) and there are active community-based user groups worldwide.
+Python was started by Guido van Rossum in 1989.
+Its name is an homage to the comedy troupe Monty Python. 
+Python 2 is used widely but support may end by 2020.
+Python 3 was introduced in 2008 and is beginning to be adopted more widely.
+They are similar, but users will encounter [some differences](http://blog.teamtreehouse.com/python-2-vs-python-3). 
+Python development is shepherded by [The Python Software Foundation](https://www.python.org/about/) and there are active community-based user groups worldwide.

data/tracks/python/exercises/collatz-conjecture/README.md

@@ -0,0 +1,61 @@
+# Collatz Conjecture
+
+The Collatz Conjecture or 3x+1 problem can be summarized as follows:
+
+Take any positive integer n. If n is even, divide n by 2 to get n / 2. If n is
+odd, multiply n by 3 and add 1 to get 3n + 1. Repeat the process indefinitely.
+The conjecture states that no matter which number you start with, you will
+always reach 1 eventually.
+
+Given a number n, return the number of steps required to reach 1.
+
+(Keep in mind that the Conjecture is only concerned with strictly positive
+integers, so your solution should return `None` if given 0 or a negative
+integer.)
+
+## Examples
+
+Starting with n = 3, the steps would be as follows:
+
+0. 3
+1. 10
+2. 5
+3. 16
+4. 8
+5. 4
+6. 2
+7. 1
+
+Resulting in 7 steps. So for input n = 3, the return value would be 7.
+
+Starting with n = 12, the steps would be as follows:
+
+0. 12
+1. 6
+2. 3
+3. 10
+4. 5
+5. 16
+6. 8
+7. 4
+8. 2
+9. 1
+
+Resulting in 9 steps. So for input n = 12, the return value would be 9.
+
+### Submitting Exercises
+
+Note that, when trying to submit an exercise, make sure the solution is in the `exercism/python/<exerciseName>` directory.
+
+For example, if you're submitting `bob.py` for the Bob exercise, the submit command would be something like `exercism submit <path_to_exercism_dir>/python/bob/bob.py`.
+
+
+For more detailed information about running tests, code style and linting,
+please see the [help page](http://exercism.io/languages/python).
+
+## Source
+
+An unsolved problem in mathematics named after mathematician Lothar Collatz [https://en.wikipedia.org/wiki/3x_%2B_1_problem](https://en.wikipedia.org/wiki/3x_%2B_1_problem)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/python/exercises/collatz-conjecture/collatz_conjecture.py

@@ -0,0 +1,2 @@
+def collatz_steps():
+    pass

data/tracks/python/exercises/collatz-conjecture/collatz_conjecture_test.py

@@ -0,0 +1,32 @@
+import unittest
+
+from collatz_conjecture import collatz_steps
+
+# Test cases adapted from `x-common//canonical-data.json` @ version: 1.1.1
+
+
+class CollatzConjectureTests(unittest.TestCase):
+
+    def test_zero_steps_for_one(self):
+        self.assertEqual(collatz_steps(1), 0)
+
+    def test_divide_if_even(self):
+        self.assertEqual(collatz_steps(16), 4)
+
+    def test_even_and_odd_steps(self):
+        self.assertEqual(collatz_steps(12), 9)
+
+    def test_large_number_of_even_and_odd_steps(self):
+        self.assertEqual(collatz_steps(1000000), 152)
+
+    def test_zero_is_invalid_input(self):
+        self.assertEqual(collatz_steps(0), None)
+
+    def test_negative_number_is_invalid_input(self):
+        self.assertEqual(collatz_steps(-1), None)
+
+        self.assertEqual(collatz_steps(-15), None)
+
+
+if __name__ == '__main__':
+    unittest.main()

data/tracks/python/exercises/collatz-conjecture/example.py

@@ -0,0 +1,17 @@
+def collatz_steps(n):
+    if n <= 0:
+        return
+
+    step_count = 0
+    while n > 1:
+        if is_odd(n):
+            n = n * 3 + 1
+        else:
+            n = n / 2
+        step_count += 1
+
+    return step_count
+
+
+def is_odd(n):
+    return n % 2 == 1

data/tracks/python/exercises/isogram/isogram.py

@@ -1,2 +1,2 @@
-def is_isogram():
+def is_isogram(string):
     pass

data/tracks/python/exercises/isogram/isogram_test.py

@@ -34,6 +34,9 @@ class TestIsogram(unittest.TestCase):
     def test_duplicated_character_in_the_middle(self):
         self.assertFalse(is_isogram("accentor"))
 
+    def test_isogram_with_duplicated_letter_and_nonletter_character(self):
+        self.assertFalse(is_isogram("Aleph Bot Chap"))
+
 
 if __name__ == '__main__':
     unittest.main()

data/tracks/python/exercises/scale-generator/example.py

@@ -26,6 +26,8 @@ class Scale(object):
         for i, interval in enumerate(self.pattern):
             pitches.append(scale[last_index])
             last_index += self.ASCENDING_INTERVALS.index(interval) + 1
+        if pitches[0] != scale[last_index % len(scale)]:
+            raise ValueError()
         return pitches
 
     def _reorder_chromatic_scale(self):

data/tracks/python/exercises/scale-generator/scale_generator_test.py

@@ -115,6 +115,10 @@ class ScaleGeneratorTest(unittest.TestCase):
         actual = enigmatic.pitches
         self.assertEqual(expected, actual)
 
+    def test_brokeninterval(self):
+        with self.assertRaises(ValueError):
+            Scale('G', 'enigmatic', 'mAMMMmM')
+
 
 if __name__ == '__main__':
     unittest.main()

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

@@ -0,0 +1,29 @@
+# Two-fer
+
+`Two-fer` or `2-fer` is short for two for one. One for you and one for me.
+
+```
+"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."
+
+### Submitting Exercises
+
+Note that, when trying to submit an exercise, make sure the solution is in the `exercism/python/<exerciseName>` directory.
+
+For example, if you're submitting `bob.py` for the Bob exercise, the submit command would be something like `exercism submit <path_to_exercism_dir>/python/bob/bob.py`.
+
+
+For more detailed information about running tests, code style and linting,
+please see the [help page](http://exercism.io/languages/python).
+
+## 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)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/python/exercises/two-fer/example.py

@@ -0,0 +1,5 @@
+def two_fer(name=""):
+    if not name.strip():
+        return "One for you, one for me."
+    else:
+        return "One for %s, one for me." % name