trackler 2.2.1.111 → 2.2.1.113

data/tracks/delphi/exercises/clock/uClockTest.pas

@@ -46,15 +46,15 @@ type
 
     [Test]
     [Ignore]
-    procedure Hour_and_minute_roll_over;
+    procedure Hour_and_minutes_roll_over;
 
     [Test]
     [Ignore]
-    procedure Hour_and_minute_roll_over_continuously;
+    procedure Hour_and_minutes_roll_over_continuously;
 
     [Test]
     [Ignore]
-    procedure Hour_and_minute_roll_over_to_exactly_midnight;
+    procedure Hour_and_minutes_roll_over_to_exactly_midnight;
 
     [Test]
     [Ignore]
@@ -269,17 +269,17 @@ begin
   Assert.AreEqual('04:43', Clock.SetHands(0, 1723).ToString);
 end;
 
-procedure TClockTest.Hour_and_minute_roll_over;
+procedure TClockTest.Hour_and_minutes_roll_over;
 begin
   Assert.AreEqual('03:40', Clock.SetHands(25, 160).ToString);
 end;
 
-procedure TClockTest.Hour_and_minute_roll_over_continuously;
+procedure TClockTest.Hour_and_minutes_roll_over_continuously;
 begin
   Assert.AreEqual('11:01', Clock.SetHands(201, 3001).ToString);
 end;
 
-procedure TClockTest.Hour_and_minute_roll_over_to_exactly_midnight;
+procedure TClockTest.Hour_and_minutes_roll_over_to_exactly_midnight;
 begin
   Assert.AreEqual('00:00', Clock.SetHands(72, 8640).ToString);
 end;

data/tracks/ecmascript/config.json

@@ -1264,6 +1264,17 @@
         "Arrays",
         "Text formatting"
       ]
+    },
+    {
+      "uuid": "b28c34f4-f7af-47db-95c6-f920e020bbba",
+      "slug": "armstrong-numbers",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 2,
+      "topics": [
+        "mathematics",
+        "algorithms"
+      ]
     }
   ],
   "foregone": []

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

@@ -0,0 +1,48 @@
+# 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.
+
+## Setup
+
+Go through the setup instructions for ECMAScript to
+install the necessary dependencies:
+
+http://exercism.io/languages/ecmascript
+
+## Requirements
+
+Install assignment dependencies:
+
+```bash
+$ npm install
+```
+
+## Making the test suite pass
+
+Execute the tests with:
+
+```bash
+$ npm test
+```
+
+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
+
+Wikipedia [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/ecmascript/exercises/armstrong-numbers/armstrong-numbers.spec.js

@@ -0,0 +1,43 @@
+import ArmstrongNumber from './armstrong-numbers';
+
+describe('ArmstrongNumber', () => {
+  test('Single digit numbers are Armstrong numbers', () => {
+    const input = 5;
+    expect(ArmstrongNumber.validate(input)).toBe(true);
+  });
+
+  xtest('There are no 2 digit Armstrong numbers', () => {
+    const input = 10;
+    expect(ArmstrongNumber.validate(input)).toBe(false);
+  });
+
+  xtest('Three digit number that is an Armstrong number', () => {
+    const input = 153;
+    expect(ArmstrongNumber.validate(input)).toBe(true);
+  });
+
+  xtest('Three digit number that is not an Armstrong number', () => {
+    const input = 100;
+    expect(ArmstrongNumber.validate(input)).toBe(false);
+  });
+
+  xtest('Four digit number that is an Armstrong number', () => {
+    const input = 9474;
+    expect(ArmstrongNumber.validate(input)).toBe(true);
+  });
+
+  xtest('Four digit number that is not an Armstrong number', () => {
+    const input = 9475;
+    expect(ArmstrongNumber.validate(input)).toBe(false);
+  });
+
+  xtest('Seven digit number that is an Armstrong number', () => {
+    const input = 9926315;
+    expect(ArmstrongNumber.validate(input)).toBe(true);
+  });
+
+  xtest('Seven digit number that is not an Armstrong number', () => {
+    const input = 9926314;
+    expect(ArmstrongNumber.validate(input)).toBe(false);
+  });
+});

data/tracks/ecmascript/exercises/armstrong-numbers/example.js

@@ -0,0 +1,11 @@
+const validate = input => {
+  const digits = [...String(input)];
+  const sum = digits.reduce((total, current) => (
+    total + Math.pow(current, digits.length)
+  ), 0);
+  return sum === input;
+}
+
+export default {
+  validate,
+}

data/tracks/ecmascript/exercises/armstrong-numbers/package.json

@@ -0,0 +1,70 @@
+{
+  "name": "xecmascript",
+  "version": "0.0.0",
+  "description": "Exercism exercises in ECMAScript 6.",
+  "author": "Katrina Owen",
+  "private": true,
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/exercism/xecmascript"
+  },
+  "devDependencies": {
+    "babel-jest": "^21.2.0",
+    "babel-plugin-transform-builtin-extend": "^1.1.2",
+    "babel-preset-env": "^1.4.0",
+    "eslint": "^3.19.0",
+    "eslint-config-airbnb": "^15.0.1",
+    "eslint-plugin-import": "^2.2.0",
+    "eslint-plugin-jsx-a11y": "^5.0.1",
+    "eslint-plugin-react": "^7.0.1",
+    "jest": "^21.2.1"
+  },
+  "jest": {
+    "modulePathIgnorePatterns": [
+      "package.json"
+    ]
+  },
+  "babel": {
+    "presets": [["env",{"node": "current"}]
+    ],
+    "plugins": [
+      [
+        "babel-plugin-transform-builtin-extend",
+        {
+          "globals": [
+            "Error"
+          ]
+        }
+      ],
+      [
+        "transform-regenerator"
+      ]
+    ]
+  },
+  "scripts": {
+    "test": "jest --no-cache ./*",
+    "watch": "jest --no-cache --watch ./*",
+    "lint": "eslint .",
+    "lint-test": "eslint . && jest --no-cache ./* "
+  },
+  "eslintConfig": {
+    "parserOptions": {
+      "ecmaVersion": 6,
+      "sourceType": "module"
+    },
+    "env": {
+      "es6": true,
+      "node": true,
+      "jest": true
+    },
+    "extends": "airbnb",
+    "rules": {
+      "import/no-unresolved": "off",
+      "import/extensions": "off"
+    }
+  },
+  "licenses": [
+    "MIT"
+  ],
+  "dependencies": {}
+}

data/tracks/javascript/config.json

@@ -1243,6 +1243,17 @@
         "searching",
         "pattern_recognition"
       ]
+    },
+    {
+      "uuid": "0e4b628c-870d-446b-a400-3cc72457f2bc",
+      "slug": "armstrong-numbers",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 2,
+      "topics": [
+        "mathematics",
+        "algorithms"
+      ]
     }
   ],
   "foregone": [],

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

@@ -0,0 +1,46 @@
+# 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.
+
+## Setup
+
+Go through the setup instructions for JavaScript to install the
+ necessary dependencies:
+
+http://exercism.io/languages/javascript/installation
+
+## Running the test suite
+
+The provided test suite uses [Jasmine](https://jasmine.github.io/).
+You can install it by opening a terminal window and running the
+following command:
+
+```sh
+npm install -g jasmine
+```
+
+Run the test suite from the exercise directory with:
+
+```sh
+jasmine armstrong-numbers.spec.js
+```
+
+In many test suites all but the first test have been marked "pending".
+Once you get a test passing, activate the next one by changing `xit` to `it`.
+
+## Source
+
+Wikipedia [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/javascript/exercises/armstrong-numbers/armstrong-numbers.spec.js

@@ -0,0 +1,43 @@
+var ArmstrongNumber = require('./armstrong-numbers');
+
+describe('ArmstrongNumber', function () {
+  it('Single digit numbers are Armstrong numbers', function () {
+    var input = 5;
+    expect(ArmstrongNumber.validate(input)).toBe(true);
+  });
+
+  xit('There are no 2 digit Armstrong numbers', function () {
+    var input = 10;
+    expect(ArmstrongNumber.validate(input)).toBe(false);
+  });
+
+  xit('Three digit number that is an Armstrong number', function () {
+    var input = 153;
+    expect(ArmstrongNumber.validate(input)).toBe(true);
+  });
+
+  xit('Three digit number that is not an Armstrong number', function () {
+    var input = 100;
+    expect(ArmstrongNumber.validate(input)).toBe(false);
+  });
+
+  xit('Four digit number that is an Armstrong number', function () {
+    var input = 9474;
+    expect(ArmstrongNumber.validate(input)).toBe(true);
+  });
+
+  xit('Four digit number that is not an Armstrong number', function () {
+    var input = 9475;
+    expect(ArmstrongNumber.validate(input)).toBe(false);
+  });
+
+  xit('Seven digit number that is an Armstrong number', function () {
+    var input = 9926315;
+    expect(ArmstrongNumber.validate(input)).toBe(true);
+  });
+
+  xit('Seven digit number that is not an Armstrong number', function () {
+    var input = 9926314;
+    expect(ArmstrongNumber.validate(input)).toBe(false);
+  });
+});

data/tracks/javascript/exercises/armstrong-numbers/example.js

@@ -0,0 +1,11 @@
+'use strict';
+
+module.exports = {
+  validate: function (input) {
+    var digits = String(input).split('');
+    var sum = digits.reduce(function (total, current) {
+      return total + Math.pow(current, digits.length);
+    }, 0);
+    return sum === input;
+  }
+};

data/tracks/objective-c/config.json

@@ -296,6 +296,18 @@
       "unlocked_by": null,
       "uuid": "d7d66773-e07f-4da1-932b-9431437d34d6"
     },
+    {
+      "core": false,
+      "difficulty": 3,
+      "slug": "series",
+      "topics": [
+        "lists",
+        "looping",
+        "integers"
+      ],
+      "unlocked_by": null,
+      "uuid": "a56e3c85-715e-4730-966f-cc46616aaa95"
+    },
     {
       "core": false,
       "difficulty": 4,

data/tracks/objective-c/exercises/series/README.md

@@ -0,0 +1,50 @@
+# Series
+
+Given a string of digits, output all the contiguous substrings of length `n` in
+that string.
+
+For example, the string "49142" has the following 3-digit series:
+
+- 491
+- 914
+- 142
+
+And the following 4-digit series:
+
+- 4914
+- 9142
+
+And if you ask for a 6-digit series from a 5-digit string, you deserve
+whatever you get.
+
+Note that these series are only required to occupy *adjacent positions*
+in the input; the digits need not be *numerically consecutive*.
+
+## Setup
+
+There are two different methods of getting set up to run the tests with Objective-C:
+
+- Create an Xcode project with a test target which will run the tests.
+- Use the ruby gem `objc` as a test runner utility.
+
+Both are described in more detail here: http://exercism.io/languages/objective-c
+
+### Submitting Exercises
+
+When submitting an exercise, make sure your solution file is in the same directory as the test code.
+
+The submit command will look something like:
+
+```shell
+exercism submit <path-to-exercism-workspace>/objective-c/sieve/Sieve.m
+```
+
+You can find the Exercism workspace by running `exercism debug` and looking for the line beginning
+with Workspace.
+
+## Source
+
+A subset of the Problem 8 at Project Euler [http://projecteuler.net/problem=8](http://projecteuler.net/problem=8)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/objective-c/exercises/series/SeriesExample.h

@@ -0,0 +1,12 @@
+#import <Foundation/Foundation.h>
+
+@interface Series : NSObject
+
+NS_ASSUME_NONNULL_BEGIN
+
+- (instancetype)initWithNumberString:(NSString *)numberString;
+- (nullable NSArray<NSArray<NSNumber *> *> *)slicesWithSize:(NSInteger)size;
+
+NS_ASSUME_NONNULL_END
+
+@end