trackler 2.2.0.3 → 2.2.0.4

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

@@ -0,0 +1,50 @@
+# Sublist
+
+Given two lists determine if the first list is contained within the second
+list, if the second list is contained within the first list, if both lists are
+contained within each other or if none of these are true.
+
+Specifically, a list A is a sublist of list B if by dropping 0 or more elements
+from the front of B and 0 or more elements from the back of B you get a list
+that's completely equal to A.
+
+Examples:
+
+ * A = [1, 2, 3], B = [1, 2, 3, 4, 5], A is a sublist of B
+ * A = [3, 4, 5], B = [1, 2, 3, 4, 5], A is a sublist of B
+ * A = [3, 4], B = [1, 2, 3, 4, 5], A is a sublist of B
+ * A = [1, 2, 3], B = [1, 2, 3], A is equal to B
+ * 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
+
+## 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`.
+
+
+## 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/sublist/example.js

@@ -0,0 +1,30 @@
+class List {
+
+  constructor(list = []) {
+    this.list = list;
+  }
+
+  compare(other) {
+    return {
+      '-1': isSublist(other.list, this.list)
+              ? 'SUBLIST'
+              : 'UNEQUAL',
+      '0':  isSublist(other.list, this.list)
+              ? 'EQUAL'
+              : 'UNEQUAL',
+      '1':  isSublist(this.list, other.list)
+              ? 'SUPERLIST'
+              : 'UNEQUAL'
+    }[lengthDiff(this, other)];
+  }
+}
+
+function lengthDiff(one, two){
+  return String(Math.sign(one.list.length - two.list.length));
+}
+
+function isSublist(one, two){
+  return one.join().match(two.join());
+}
+
+export default List;

data/tracks/ecmascript/exercises/sublist/package.json

@@ -0,0 +1,69 @@
+{
+  "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": "^20.0.1",
+    "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": "^20.0.1"
+  },
+  "jest": {
+    "modulePathIgnorePatterns": [
+      "package.json"
+    ]
+  },
+  "babel": {
+    "presets": [
+      "env"
+    ],
+    "plugins": [
+      [
+        "babel-plugin-transform-builtin-extend",
+        {
+          "globals": [
+            "Error"
+          ]
+        }
+      ]
+    ]
+  },
+  "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/ecmascript/exercises/sublist/sublist.spec.js

@@ -0,0 +1,126 @@
+import List from './sublist';
+
+
+describe('sublist', () => {
+
+  test('two empty lists are equal', () => {
+    const listOne = new List();
+    const listTwo = new List();
+
+    expect(listOne.compare(listTwo)).toEqual('EQUAL');
+  });
+
+  xtest('an empty list is a sublist of a non-empty list', () => {
+    const listOne = new List();
+    const listTwo = new List([1, 2, 3]);
+
+    expect(listOne.compare(listTwo)).toEqual('SUBLIST');
+  });
+
+  xtest('non empty list contains empty list', () => {
+    const listOne = new List([1, 2, 3]);
+    const listTwo = new List();
+
+    expect(listOne.compare(listTwo)).toEqual('SUPERLIST');
+  });
+
+  xtest('a non-empty list equals itself', () => {
+    const listOne = new List([1, 2, 3]);
+    const listTwo = new List([1, 2, 3]);
+
+    expect(listOne.compare(listTwo)).toEqual('EQUAL');
+  });
+
+  xtest('two different lists are unequal', () => {
+    const listOne = new List([1, 2, 3]);
+    const listTwo = new List([2, 3, 4]);
+
+    expect(listOne.compare(listTwo)).toEqual('UNEQUAL');
+  });
+
+  xtest('false start', () => {
+    const listOne = new List([1, 2, 5]);
+    const listTwo = new List([0, 1, 2, 3, 1, 2, 5, 6]);
+
+    expect(listOne.compare(listTwo)).toEqual('SUBLIST');
+
+  });
+
+  xtest('consecutive', () => {
+    const listOne = new List([1, 1, 2]);
+    const listTwo = new List([0, 1, 1, 1, 2, 1, 2]);
+
+    expect(listOne.compare(listTwo)).toEqual('SUBLIST');
+  });
+
+  xtest('sublist at start', () => {
+    const listOne = new List([0, 1, 2]);
+    const listTwo = new List([0, 1, 2, 3, 4, 5]);
+
+    expect(listOne.compare(listTwo)).toEqual('SUBLIST');
+  });
+
+  xtest('sublist in middle', () => {
+    const listOne = new List([2, 3, 4]);
+    const listTwo = new List([0, 1, 2, 3, 4, 5]);
+
+    expect(listOne.compare(listTwo)).toEqual('SUBLIST');
+  });
+
+  xtest('sublist at end', () => {
+    const listOne = new List([3, 4, 5]);
+    const listTwo = new List([0, 1, 2, 3, 4, 5]);
+
+    expect(listOne.compare(listTwo)).toEqual('SUBLIST');
+  });
+
+  xtest('at start of superlist', () => {
+    const listOne = new List([0, 1, 2, 3, 4, 5]);
+    const listTwo = new List([0, 1, 2]);
+
+    expect(listOne.compare(listTwo)).toEqual('SUPERLIST');
+  });
+
+  xtest('in middle of superlist', () => {
+    const listOne = new List([0, 1, 2, 3, 4, 5]);
+    const listTwo = new List([2, 3]);
+
+    expect(listOne.compare(listTwo)).toEqual('SUPERLIST');
+  });
+
+  xtest('at end of superlist', () => {
+    const listOne = new List([0, 1, 2, 3, 4, 5]);
+    const listTwo = new List([3, 4, 5]);
+
+    expect(listOne.compare(listTwo)).toEqual('SUPERLIST');
+  });
+
+  xtest('first list missing element from second list', () => {
+    const listOne = new List([1, 3]);
+    const listTwo = new List([1, 2, 3]);
+
+    expect(listOne.compare(listTwo)).toEqual('UNEQUAL');
+  });
+
+  xtest('second list missing element from first list', () => {
+    const listOne = new List([1, 2, 3]);
+    const listTwo = new List([1, 3]);
+
+    expect(listOne.compare(listTwo)).toEqual('UNEQUAL');
+  });
+
+  xtest('order matters to a list', () => {
+    const listOne = new List([1, 2, 3]);
+    const listTwo = new List([3, 2, 1]);
+
+    expect(listOne.compare(listTwo)).toEqual('UNEQUAL');
+  });
+
+  xtest('same digits but different numbers', () => {
+    const listOne = new List([1, 0, 1]);
+    const listTwo = new List([10, 1]);
+
+    expect(listOne.compare(listTwo)).toEqual('UNEQUAL');
+  });
+
+});

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

@@ -0,0 +1,48 @@
+# Sum Of Multiples
+
+Given a number, find the sum of all the 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.
+
+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
+
+## 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
+
+A variation on Problem 1 at Project Euler [http://projecteuler.net/problem=1](http://projecteuler.net/problem=1)
+
+## 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/triangle/README.md

@@ -0,0 +1,56 @@
+# Triangle
+
+Determine if a triangle is equilateral, isosceles, or scalene.
+
+An _equilateral_ triangle has all three sides the same length.<br/>
+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/>
+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 
+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 
+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
+
+## 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
+
+The Ruby Koans triangle project, parts 1 & 2 [http://rubykoans.com](http://rubykoans.com)
+
+## 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/trinary/README.md

@@ -0,0 +1,58 @@
+# Trinary
+
+Convert a trinary number, represented as a string (e.g. '102012'), to its
+decimal equivalent using first principles.
+
+The program should consider strings specifying an invalid trinary as the
+value 0.
+
+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
+# "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
+  243 +     0 +    54 +     0 +     3 +     2 =  302
+```
+
+If your language provides a method in the standard library to perform the
+conversion, pretend it doesn't exist and implement it yourself.
+
+## 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
+
+All of Computer Science [http://www.wolframalpha.com/input/?i=binary&a=*C.binary-_*MathWorld-](http://www.wolframalpha.com/input/?i=binary&a=*C.binary-_*MathWorld-)
+
+## 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/two-bucket/README.md

@@ -0,0 +1,66 @@
+# Two Bucket
+
+Given two buckets of different size, demonstrate how to measure an exact number of liters by strategically transferring liters of fluid between the buckets.
+
+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! 
+
+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')
+
+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
+
+Note: any time a change is made to either or both buckets counts as one (1) move. 
+
+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:
+- pouring from one bucket to another
+- emptying one bucket and doing nothing to the other
+- filling one bucket and doing nothing to the other
+
+Written with <3 at [Fullstack Academy](http://www.fullstackacademy.com/) by [Lindsay](http://lindsaylevine.com).
+
+## 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
+
+Water Pouring Problem [http://demonstrations.wolfram.com/WaterPouringProblem/](http://demonstrations.wolfram.com/WaterPouringProblem/)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.