trackler 2.2.1.132 → 2.2.1.133

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: e478de20af389be52d781a2d47847e675fcb3445
-  data.tar.gz: 1b158116931fb875e127102199db876edf2cfc56
+  metadata.gz: 823d7cfe149655bf74ac3093c3948cd9e385e612
+  data.tar.gz: 42596817dd6559ca7642e6eb9ceb543dc9055751
 SHA512:
-  metadata.gz: ba89ba4b7f07e6c582a4950ffdac818fa16e2831613d22b06de2ef46bfc0bf8c9369b591afeb1ffea22438bcd123df033d87f68f9559fe084049c20849ac470b
-  data.tar.gz: d00499a417f38ad4e78668e656faf9e262173f951a3ee7addd50906a4f5c707fb609a6ab43e2b781e05375d64bdbf36d9e710d7d801e99a54b6a27d9e296bdf3
+  metadata.gz: d07624593c2464b858dbf6c2f6bf7c78d38451b1f0a579d8321e9a8a3a3e2632bd5f127d09f3c96e4125603e43193260d8e7c2612001b14b9f319f3e34835ece
+  data.tar.gz: 20c3e8d8037e8fb4130997771cc0886c83f214c94a7a0060870af86d9e5ba18d449e7d56430bfa29c96404f0d0c4e890ca208165cd573c9ed32e9169ffac104a

data/lib/trackler/version.rb

@@ -1,3 +1,3 @@
 module Trackler
-  VERSION = "2.2.1.132"
+  VERSION = "2.2.1.133"
 end

data/tracks/dart/config.json

@@ -26,6 +26,19 @@
       "unlocked_by": null,
       "uuid": "4bcfd789-dee6-4dd9-8524-076508504eda"
     },
+    {
+      "core": true,
+      "difficulty": 1,
+      "slug": "armstrong-numbers",
+      "topics": [
+        "equality",
+        "integers",
+        "logic",
+        "strings"
+      ],
+      "unlocked_by": null,
+      "uuid": "4f650701-9568-4d95-9f72-be4bde2c90ec"
+    },
     {
       "core": true,
       "difficulty": 2,

data/tracks/dart/exercises/armstrong-numbers/README.md

@@ -0,0 +1,29 @@
+# Armstrong Numbers
+
+An [Armstrong number](https://en.wikipedia.org/wiki/Narcissistic_number) is a number that is the sum of its own digits each raised to the power of the number of digits.
+
+For example:
+
+- 9 is an Armstrong number, because `9 = 9^1 = 9`
+- 10 is *not* an Armstrong number, because `10 != 1^2 + 0^2 = 2`
+- 153 is an Armstrong number, because: `153 = 1^3 + 5^3 + 3^3 = 1 + 125 + 27 = 153`
+- 154 is *not* an Armstrong number, because: `154 != 1^3 + 5^3 + 4^3 = 1 + 125 + 64 = 190`
+
+Write some code to determine whether a number is an Armstrong number.
+
+
+To run the tests:
+
+```sh
+$ pub run test
+```
+
+For more detailed info about the Dart track see the [help page](http://exercism.io/languages/dart).
+
+
+## Source
+
+Wikipedia [https://en.wikipedia.org/wiki/Narcissistic_number](https://en.wikipedia.org/wiki/Narcissistic_number)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/dart/exercises/armstrong-numbers/lib/armstrong_numbers.dart

@@ -0,0 +1,3 @@
+class ArmstrongNumbers {
+  // Put your code here
+}

data/tracks/dart/exercises/armstrong-numbers/lib/example.dart

@@ -0,0 +1,20 @@
+import 'dart:math' show pow;
+
+class ArmstrongNumbers {
+
+  /// The parameters and variables within the method that are set to final in order to prevent the accidentally modification of the value.
+  /// As those variables are not needed to be changed.
+  bool isArmstrongNumber(final int number) {
+    final String numberAsString = number.toString();
+    final int numOfDigits = numberAsString.length;
+    int sum = 0;
+
+    for (int count = 0; count < numOfDigits; count++) {
+      final String digitAsString = numberAsString.substring(count, count + 1);
+      final int digit = int.parse(digitAsString);
+      sum += pow(digit, numOfDigits);
+    }
+
+    return number == sum;
+  }
+}

data/tracks/dart/exercises/armstrong-numbers/pubspec.yaml

@@ -0,0 +1,3 @@
+name: 'armstrong_numbers'
+dev_dependencies:
+  test: '<0.13.0'

data/tracks/dart/exercises/armstrong-numbers/test/armstrong_numbers_test.dart

@@ -0,0 +1,48 @@
+import "package:test/test.dart";
+import "package:armstrong_numbers/armstrong_numbers.dart";
+
+void main() {
+  final ArmstrongNumbers armstrongNumbers = new ArmstrongNumbers();
+
+  group("ArmstrongNumbers", () {
+    test("Single digit numbers are Armstrong numbers", () {
+      final bool result = armstrongNumbers.isArmstrongNumber(5);
+      expect(result, equals(true));
+    }, skip: false);
+
+    test("There are no 2 digit Armstrong numbers", () {
+      final bool result = armstrongNumbers.isArmstrongNumber(10);
+      expect(result, equals(false));
+    }, skip: true);
+
+    test("Three digit number that is an Armstrong number", () {
+      final bool result = armstrongNumbers.isArmstrongNumber(153);
+      expect(result, equals(true));
+    }, skip: true);
+
+    test("Three digit number that is not an Armstrong number", () {
+      final bool result = armstrongNumbers.isArmstrongNumber(100);
+      expect(result, equals(false));
+    }, skip: true);
+
+    test("Four digit number that is an Armstrong number", () {
+      final bool result = armstrongNumbers.isArmstrongNumber(9474);
+      expect(result, equals(true));
+    }, skip: true);
+
+    test("Four digit number that is not an Armstrong number", () {
+      final bool result = armstrongNumbers.isArmstrongNumber(9475);
+      expect(result, equals(false));
+    }, skip: true);
+
+    test("Seven digit number that is an Armstrong number", () {
+      final bool result = armstrongNumbers.isArmstrongNumber(9926315);
+      expect(result, equals(true));
+    }, skip: true);
+
+    test("Seven digit number that is not an Armstrong number", () {
+      final bool result = armstrongNumbers.isArmstrongNumber(9926314);
+      expect(result, equals(false));
+    }, skip: true);
+  });
+}

data/tracks/dart/exercises/leap/test/leap_test.dart

@@ -24,5 +24,20 @@ void main() {
       final bool result = leap.leapYear(2000);
       expect(result, equals(true));
     }, skip: true);
+
+    test("is introduced every 4 years to adjust about a day before 400 A.D.", () {
+      final bool result = leap.leapYear(4);
+      expect(result, equals(true));
+    }, skip: true);
+
+    test("is skipped every 100 years to remove an extra day before 400 A.D.", () {
+      final bool result = leap.leapYear(300);
+      expect(result, equals(false));
+    }, skip: true);
+
+    test("is reintroduced every 400 years to adjust another day including 400 A.D.", () {
+      final bool result = leap.leapYear(400);
+      expect(result, equals(true));
+    }, skip: true);
   });
 }

data/tracks/haskell/.travis.yml

@@ -30,6 +30,7 @@ install:
  - travis_retry curl -L https://www.stackage.org/stack/linux-x86_64 -o pack.tgz
  - tar xzf pack.tgz --wildcards --strip-components=1 -C ${HOME}/bin '*/stack'
  - stack --resolver ${RESOLVER} --install-ghc install hlint
+ - stack --version
 
 script:
  - "sh ./bin/ensure-readmes-are-updated.sh"

data/tracks/nim/.travis.yml

@@ -3,15 +3,18 @@ dist: trusty
 
 language: c
 
+env:
+  - NIM_VERSION="0.18.0"
+
 install:
   - cd _test
-  - wget http://nim-lang.org/download/nim-0.14.2.tar.xz
-  - tar xf nim-0.14.2.tar.xz
-  - cd nim-0.14.2
+  - wget https://nim-lang.org/download/nim-$NIM_VERSION.tar.xz
+  - tar xf nim-$NIM_VERSION.tar.xz
+  - cd nim-$NIM_VERSION
   - ./build.sh
   - cd ../..
 
-before_script: export PATH=$PATH:$PWD/_test/nim-0.14.2/bin
+before_script: export PATH=$PATH:$PWD/_test/nim-$NIM_VERSION/bin
 
 script:
   - bin/fetch-configlet

data/tracks/nim/exercises/anagram/example.nim

@@ -9,7 +9,7 @@ proc isAnagramTo(a, b: TAnagram): bool {.noSideEffect, procVar.} =
   a.chars == b.chars and cmpIgnoreCase(a.word, b.word) != 0
 
 proc anagram(word: string): TAnagram =
-  var chars = toSeq(word.toLower().items)
+  var chars = toSeq(word.toLowerAscii().items)
   sort(chars, cmp[char])
   (word, chars)
 

data/tracks/nim/exercises/word-count/example.nim

@@ -6,12 +6,14 @@ type TWordCount* = CritBitTree[int]
 
 iterator words(s: string): string =
   for word in s.split(AllChars - Letters - Digits - {'\0'}):
-    yield toLower(word)
+    yield toLowerAscii(word)
 
 proc wordCount*(s: string): TWordCount {.noSideEffect.} =
   ## Returns a mapping from the words (alphanumeric sequences) in `s` to their
   ## respective counts.
   for word in words(s):
+    if word.len == 0:
+      continue
     if not result.hasKey(word):
       result[word] = 0
     result[word] = result[word] + 1

data/tracks/r/config.json

@@ -253,7 +253,7 @@
         "control_flow_conditionals",
         "mathematics"
       ],
-      "unlocked_by": "sum-of-multiples",
+      "unlocked_by": null,
       "uuid": "f3e93545-7466-4635-b508-7e02517fdf06"
     },
     {

data/tracks/scala/exercises/bob/README.md

@@ -6,6 +6,8 @@ Bob answers 'Sure.' if you ask him a question.
 
 He answers 'Whoa, chill out!' if you yell at him.
 
+He answers 'Calm down, I know what I'm doing!' if you yell a question at him.
+
 He says 'Fine. Be that way!' if you address him without actually saying
 anything.
 

data/tracks/typescript/config.json

@@ -386,6 +386,20 @@
       "unlocked_by": "space-age",
       "uuid": "59d842b4-a804-4cd5-a388-983a22a70c9e"
     },
+    {
+      "core": false,
+      "difficulty": 4,
+      "slug": "house",
+      "topics": [
+        "control_flow_conditionals",
+        "control_flow_loops",
+        "strings",
+        "arrays",
+        "recursion"
+      ],
+      "unlocked_by": "bob",
+      "uuid": "9850a74a-1842-4db0-b3ed-5a53b4f25050"
+    },
     {
       "core": false,
       "difficulty": 5,
@@ -910,11 +924,11 @@
         "mathematics",
         "algorithms"
       ],
-      "unlocked_by": "pascals-triangle",
+      "unlocked_by": null,
       "uuid": "4439ab9d-266b-483b-b5ca-3920c478fd62"
     },
     {
-      "core": false,
+      "core": true,
       "difficulty": 5,
       "slug": "binary-search",
       "topics": [
@@ -1058,7 +1072,7 @@
         "loops",
         "transforming"
       ],
-      "unlocked_by": "two-bucket",
+      "unlocked_by": "pangram",
       "uuid": "50050198-b5a3-4ab1-8b4b-0eadc8007ebb"
     },
     {
@@ -1078,4 +1092,4 @@
   "foregone": [],
   "language": "TypeScript",
   "test_pattern": ".*[.]test[.]ts$"
-}
+}

data/tracks/typescript/exercises/house/README.md

@@ -0,0 +1,138 @@
+# House
+
+Recite the nursery rhyme 'This is the House that Jack Built'.
+
+> [The] process of placing a phrase of clause within another phrase of
+> clause is called embedding. It is through the processes of recursion
+> and embedding that we are able to take a finite number of forms (words
+> and phrases) and construct an infinite number of expressions.
+> Furthermore, embedding also allows us to construct an infinitely long
+> structure, in theory anyway.
+
+- [papyr.com](http://papyr.com/hypertextbooks/grammar/ph_noun.htm)
+
+The nursery rhyme reads as follows:
+
+```text
+This is the house that Jack built.
+
+This is the malt
+that lay in the house that Jack built.
+
+This is the rat
+that ate the malt
+that lay in the house that Jack built.
+
+This is the cat
+that killed the rat
+that ate the malt
+that lay in the house that Jack built.
+
+This is the dog
+that worried the cat
+that killed the rat
+that ate the malt
+that lay in the house that Jack built.
+
+This is the cow with the crumpled horn
+that tossed the dog
+that worried the cat
+that killed the rat
+that ate the malt
+that lay in the house that Jack built.
+
+This is the maiden all forlorn
+that milked the cow with the crumpled horn
+that tossed the dog
+that worried the cat
+that killed the rat
+that ate the malt
+that lay in the house that Jack built.
+
+This is the man all tattered and torn
+that kissed the maiden all forlorn
+that milked the cow with the crumpled horn
+that tossed the dog
+that worried the cat
+that killed the rat
+that ate the malt
+that lay in the house that Jack built.
+
+This is the priest all shaven and shorn
+that married the man all tattered and torn
+that kissed the maiden all forlorn
+that milked the cow with the crumpled horn
+that tossed the dog
+that worried the cat
+that killed the rat
+that ate the malt
+that lay in the house that Jack built.
+
+This is the rooster that crowed in the morn
+that woke the priest all shaven and shorn
+that married the man all tattered and torn
+that kissed the maiden all forlorn
+that milked the cow with the crumpled horn
+that tossed the dog
+that worried the cat
+that killed the rat
+that ate the malt
+that lay in the house that Jack built.
+
+This is the farmer sowing his corn
+that kept the rooster that crowed in the morn
+that woke the priest all shaven and shorn
+that married the man all tattered and torn
+that kissed the maiden all forlorn
+that milked the cow with the crumpled horn
+that tossed the dog
+that worried the cat
+that killed the rat
+that ate the malt
+that lay in the house that Jack built.
+
+This is the horse and the hound and the horn
+that belonged to the farmer sowing his corn
+that kept the rooster that crowed in the morn
+that woke the priest all shaven and shorn
+that married the man all tattered and torn
+that kissed the maiden all forlorn
+that milked the cow with the crumpled horn
+that tossed the dog
+that worried the cat
+that killed the rat
+that ate the malt
+that lay in the house that Jack built.
+```
+
+## Setup
+
+Go through the setup instructions for TypeScript to
+install the necessary dependencies:
+
+http://exercism.io/languages/typescript
+
+## Requirements
+
+Install assignment dependencies:
+
+```bash
+$ yarn install
+```
+
+## Making the test suite pass
+
+Execute the tests with:
+
+```bash
+$ yarn test
+```
+
+
+
+## Source
+
+British nursery rhyme [http://en.wikipedia.org/wiki/This_Is_The_House_That_Jack_Built](http://en.wikipedia.org/wiki/This_Is_The_House_That_Jack_Built)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/typescript/exercises/house/house.example.ts

@@ -0,0 +1,67 @@
+const OBJECTS = [
+    'house',
+    'malt',
+    'rat',
+    'cat',
+    'dog',
+    'cow with the crumpled horn',
+    'maiden all forlorn',
+    'man all tattered and torn',
+    'priest all shaven and shorn',
+    'rooster that crowed in the morn',
+    'farmer sowing his corn',
+    'horse and the hound and the horn',
+]
+
+const ACTIONS = [
+    'Jack built',
+    'lay in',
+    'ate',
+    'killed',
+    'worried',
+    'tossed',
+    'milked',
+    'kissed',
+    'married',
+    'woke',
+    'kept',
+    'belonged to',
+]
+
+class House {
+    static verse(verseNumber: number) {
+        const lines = []
+        const totalLines = verseNumber
+        let itemIndex = verseNumber - 1
+        for (let lineNumber = 1; lineNumber <= totalLines; lineNumber += 1) {
+            let lineText = ''
+            if (lineNumber === 1) {
+                lineText += 'This is'
+            } else {
+                lineText += `that ${ACTIONS[itemIndex]}`
+                itemIndex -= 1
+            }
+
+            lineText += ` the ${OBJECTS[itemIndex]}`
+            if (lineNumber === totalLines) {
+                lineText += ` that ${ACTIONS[itemIndex]}.`
+            }
+            lines.push(lineText)
+        }
+        return lines
+    }
+
+    static verses(start: number, end: number) {
+        let lines: string[] = []
+        for (let i = start; i <= end; i += 1) {
+            const verseLines = House.verse(i)
+            lines = lines.concat(verseLines)
+            if (i < end) {
+                lines.push('')
+            }
+        }
+        return lines
+    }
+}
+
+export default House