trackler 2.2.1.45 → 2.2.1.46

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

@@ -2,24 +2,27 @@
 
 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.
 
+
 To run the tests:
 
 ```sh

data/tracks/java/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

data/tracks/java/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.

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

@@ -2,7 +2,7 @@
 
 `Two-fer` or `2-fer` is short for two for one. One for you and one for me.
 
-```
+```text
 "One for X, one for me."
 ```
 
@@ -11,7 +11,6 @@ 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."
 
-
 ## Test-Driven Development
 
 As programmers mature, they eventually want to test their code.

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

@@ -4,7 +4,7 @@ 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
@@ -12,7 +12,6 @@ free: 1
 ```
 
 
-
 To run the tests:
 
 ```sh

data/tracks/java/exercises/word-search/.meta/.version

@@ -0,0 +1 @@
+1.0.0

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

@@ -5,7 +5,7 @@ words in them.
 
 For example:
 
-```
+```text
 jefblpepre
 camdcimgtc
 oivokprjsm

data/tracks/java/exercises/word-search/src/test/java/WordSearcherTest.java

@@ -5,9 +5,6 @@ import java.util.*;
 
 import static org.junit.Assert.assertEquals;
 
-/*
- * version: 1.0.0
- */
 public class WordSearcherTest {
 
     private WordSearcher wordSearcher;

data/tracks/java/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.
@@ -56,7 +52,6 @@ If you'd like, handle exponentials.
 32
 
 
-
 To run the tests:
 
 ```sh

data/tracks/javascript/config.json

@@ -1080,6 +1080,19 @@
         "Pattern recognition",
         "Regular expressions"
       ]
+    },
+    {
+      "uuid": "52c775a4-7ddb-4cba-8a78-8544220bd1b6",
+      "slug": "protein-translation",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 1,
+      "topics": [
+        "control-flow-(conditionals)",
+        "control-flow-(loops)",
+        "strings",
+        "algorithms"
+      ]
     }
   ],
   "foregone": [],

data/tracks/javascript/docs/TESTS.md

@@ -26,7 +26,7 @@ To get started, you can download a Visual Studio solution that is already set up
 
 1. Download the [Exercism.io Visual Studio Template](https://github.com/rprouse/Exercism.VisualStudio) from GitHub by clicking the Download Zip button on the page.
 2. Unzip the template into your exercises directory, for example `C:\src\exercises`
-2. Install the [Exercism CLI](http://exercism.io/cli)
+2. Install the [Exercism CLI](http://exercism.io/clients/cli)
 3. Open a command prompt to your exercise directory
 4. Add your API key to exercism `exercism configure --key=YOUR_API_KEY`
 5. Configure your source directory in exercism `exercism configure --dir=C:\src\exercises`

data/tracks/javascript/exercises/diffie-hellman/example.js

@@ -10,7 +10,7 @@ var DiffieHellman = function(p, g){
 
   this.getPublicKeyFromPrivateKey = function (privateKey) {
     if (privateKey <= 1 || privateKey > this.p - 1) {
-      throw Error('Private key a must be greater than one but less than modulus parameter p!');
+      throw Error('Private key must be greater than one but less than modulus parameter p!');
     }
     return Math.pow(this.g, privateKey) % this.p;
   };

data/tracks/javascript/exercises/hello-world/example.js

@@ -2,9 +2,8 @@
 
 var HelloWorld = function () {};
 
-HelloWorld.prototype.hello = function (name) {
-  name = name || 'World';
-  return 'Hello, ' + name + '!';
+HelloWorld.prototype.hello = function () {
+  return 'Hello, World!';
 };
 
 module.exports = HelloWorld;

data/tracks/javascript/exercises/meetup/example.js

@@ -1,43 +1,40 @@
+'use strict';
+
 function MeetupDayException(message) {
   this.message = message;
   this.name = 'MeetupDayException';
 }
 
-function meetupDay(year, month, day_of_week, which) {
-  'use strict';
-
-  var candidates = _getCandidates(year, month, day_of_week),
-    d,
-    i,
-    res;
-  which = which.toLowerCase();
+function meetupDay(year, month, dayOfWeek, which) {
+  var candidates = _getCandidates(year, month, dayOfWeek);
+  var res;
+  var day;
 
-  if (which === 'teenth') {
-    res = _find(candidates, function (d) {
-      return d.getDate() >= 13 && d.getDate() <= 19;
-    });
-  } else if (which === 'last') {
+  day = which.toLowerCase();
+  if (day === 'teenth') {
+    res = _find(candidates, function (d) {return d.getDate() >= 13 && d.getDate() <= 19; });
+  } else if (day === 'last') {
     res = candidates.pop();
   } else {
-    which = parseInt(which) - 1;
-    res = candidates.slice(which, which + 1).pop();
+    day = parseInt(day, 10) - 1;
+    res = candidates.slice(day, day + 1).pop();
   }
 
-  if (!res) { throw new MeetupDayException('Day not found! ;_;'); }
+  if (!res) { throw new MeetupDayException('Day not found!'); }
 
   return res;
 }
 
-function _getCandidates(year, month, day_of_week) {
-  var d,
-    i,
-    numDaysInMonth = new Date(year, month + 1, 0).getDate(),
-    res = [];
+function _getCandidates(year, month, dayOfWeek) {
+  var d;
+  var i;
+  var numDaysInMonth = new Date(year, month + 1, 0).getDate();
+  var res = [];
 
   for (i = 0; i < numDaysInMonth; i++) {
     d = new Date(year, month, i + 1);
 
-    if (d.getDay() === _getDayIndex(day_of_week)) {
+    if (d.getDay() === _getDayIndex(dayOfWeek)) {
       res.push(d);
     }
   }
@@ -55,16 +52,16 @@ function _getDayIndex(day) {
     'friday': 5,
     'saturday': 6
   };
-
-  day = day.toLowerCase();
-
-  return daysInd[day];
+  return daysInd[day.toLowerCase()];
 }
 
 function _find(ary, callback) {
+  var foundDay;
   for (var i = 0; i < ary.length; i++) {
-    if (callback(ary[i], i, ary)) { return ary[i]; }
+    if (callback(ary[i], i, ary)) foundDay = ary[i];
   }
+  return foundDay;
 }
 
 module.exports = meetupDay;
+

data/tracks/javascript/exercises/meetup/meetup.spec.js

@@ -1,11 +1,5 @@
 var meetupDay = require('./meetup');
 
-
-function MeetupDayException(message) {
-  this.message = message;
-  this.name = 'MeetupDayException';
-}
-
 describe('meetupDay()', function () {
   it('monteenth of may 2013', function () {
     expect(meetupDay(2013, 4, 'Monday', 'teenth')).toEqual(new Date(2013, 4, 13));

data/tracks/javascript/exercises/nucleotide-count/nucleotide-count.spec.js

@@ -20,7 +20,7 @@ describe('DNA', function () {
     expect(acid.count('T')).toEqual(2);
   });
 
-  xit('Empty DNS strand has no nucleotides', function () {
+  xit('Empty DNA strand has no nucleotides', function () {
     var expected = {A: 0, T: 0, C: 0, G: 0};
     expect(dna().histogram()).toEqual(expected);
   });

data/tracks/javascript/exercises/protein-translation/README.md

@@ -0,0 +1,73 @@
+# Protein Translation
+
+Translate RNA sequences into proteins.
+
+RNA can be broken into three nucleotide sequences called codons, and then translated to a polypeptide like so:
+
+RNA: `"AUGUUUUCU"` => translates to
+
+Codons: `"AUG", "UUU", "UCU"`
+=> which become a polypeptide with the following sequence =>
+
+Protein: `"Methionine", "Phenylalanine", "Serine"`
+ 
+There are 64 codons which in turn correspond to 20 amino acids; however, all of the codon sequences and resulting amino acids are not important in this exercise.  If it works for one codon, the program should work for all of them.
+However, feel free to expand the list in the test suite to include them all.  
+
+There are also four terminating codons (also known as 'STOP' codons); if any of these codons are encountered (by the ribosome), all translation ends and the protein is terminated.
+
+All subsequent codons after are ignored, like this:
+
+RNA: `"AUGUUUUCUUAAAUG"` =>
+
+Codons: `"AUG", "UUU", "UCU", "UAG", "AUG"` => 
+
+Protein: `"Methionine", "Phenylalanine", "Serine"`
+
+Note the stop codon terminates the translation and the final methionine is not translated into the protein sequence.
+
+Below are the codons and resulting Amino Acids needed for the exercise.
+
+Codon                 | Protein
+:---                  | :---
+AUG                   | Methionine
+UUU, UUC              | Phenylalanine
+UUA, UUG              | Leucine
+UCU, UCC, UCA, UCG    | Serine
+UAU, UAC              | Tyrosine
+UGU, UGC              | Cysteine
+UGG                   | Tryptophan
+UAA, UAG, UGA         | STOP
+
+
+Learn more about [protein translation on Wikipedia](http://en.wikipedia.org/wiki/Translation_(biology))
+
+## Setup
+
+Go through the setup instructions for JavaScript to
+install the necessary dependencies:
+
+http://exercism.io/languages/javascript
+
+## Making the Test Suite Pass
+
+Execute the tests with:
+
+    jasmine <exercise-name>.spec.js
+
+Replace `<exercise-name>` with the name of the current exercise. E.g., to
+test the Hello World exercise:
+
+    jasmine hello-world.spec.js
+
+In many test suites all but the first test have been skipped.
+
+Once you get a test passing, you can unskip the next one by
+changing `xit` to `it`.
+
+## Source
+
+Tyler Long
+
+## 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/protein-translation/example.js

@@ -0,0 +1,68 @@
+'use strict';
+
+module.exports = translate;
+
+function translate(rnaStrand) {
+  var proteins = [];
+
+  if (rnaStrand) {
+    for (var i = 0; i < rnaStrand.length; i+=3) {
+      var protein = getProtein(rnaStrand.substring(i, i + 3));
+
+      if (protein) {
+
+        if (protein === "STOP") {
+          break;
+        }
+
+        if (protein === "INVALID") {
+          throw new Error('Invalid codon');
+        }
+
+        proteins.push(protein);
+      }
+    }
+  }
+
+  return proteins;
+}
+
+function getProtein(codon) {
+  switch (codon) {
+    case "AUG":
+      return "Methionine";
+
+    case "UUU":
+    case "UUC":
+      return "Phenylalanine";
+
+    case "UUA":
+    case "UUG":
+      return "Leucine";
+
+    case "UCU":
+    case "UCC":
+    case "UCA":
+    case "UCG":
+      return "Serine";
+
+    case "UAU":
+    case "UAC":
+      return "Tyrosine";
+
+    case "UGU":
+    case "UGC":
+      return "Cysteine";
+
+    case "UGG":
+      return "Tryptophan";
+
+    case "UAA":
+    case "UAG":
+    case "UGA":
+      return "STOP";
+
+    default:
+      return "INVALID";
+  }
+}