trackler 2.2.1.75 → 2.2.1.76

data/tracks/java/exercises/pig-latin/README.md

@@ -78,6 +78,7 @@ The new error should tell you which type it's expecting.
 
 After having resolved these errors you should be ready to start making the tests pass!
 
+
 # Running the tests
 
 You can run all the tests for an exercise by entering

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

@@ -1,4 +1,6 @@
-#Translate RNA sequences into proteins.
+# 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:
 
@@ -55,4 +57,4 @@ Tyler Long
 
 ## Submitting Incomplete Solutions
 
-It's possible to submit an incomplete solution so you can see how others have completed the exercise.
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

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

@@ -37,27 +37,27 @@ The above diagram contains 6 rectangles:
 ```
 
 ```text
-       
-       
+
+
    +--+
    |  |
    +--+
 ```
 
 ```text
-       
-       
+
+
 +--+
 |  |
 +--+
 ```
 
 ```text
-       
-  ++   
-  ++   
-       
-       
+
+  ++
+  ++
+
+
 ```
 
 You may assume that the input is always a proper rectangle (i.e. the length of

data/tracks/java/exercises/settings.gradle

@@ -49,6 +49,7 @@ include 'ocr-numbers'
 include 'octal'
 include 'palindrome-products'
 include 'pangram'
+include 'parallel-letter-frequency'
 include 'pascals-triangle'
 include 'perfect-numbers'
 include 'phone-number'

data/tracks/java/exercises/simple-cipher/README.md

@@ -58,15 +58,13 @@ would get the same thing as the Caesar Cipher.
 
 The weakest link in any cipher is the human being. Let's make your
 substitution cipher a little more fault tolerant by providing a source
-of randomness and ensuring that the key is not composed of numbers or
-capital letters.
+of randomness and ensuring that the key contains only lowercase letters.
 
 If someone doesn't submit a key at all, generate a truly random key of
-at least 100 characters in length, accessible via Cipher#key (the #
-syntax means instance variable)
+at least 100 characters in length.
 
-If the key submitted has capital letters or numbers, throw an
-ArgumentError with a message to that effect.
+If the key submitted is not composed only of lowercase letters, your
+solution should handle the error in a language-appropriate way.
 
 ## Extensions
 

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

@@ -1,10 +1,10 @@
 # Sum Of Multiples
 
-Given a number, find the sum of all the multiples of particular numbers up to
+Given a number, find the sum of all the unique 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.
+If we list all the natural numbers below 20 that are multiples of 3 or 5,
+we get 3, 5, 6, 9, 10, 12, 15, and 18.
 
 The sum of these multiples is 78.
 

data/tracks/objective-c/config.json

@@ -12,6 +12,17 @@
       "unlocked_by": null,
       "uuid": "da5eb908-8cdf-4f99-93f7-c2b7dcb4fb37"
     },
+    {
+      "core": false,
+      "difficulty": 1,
+      "slug": "two-fer",
+      "topics": [
+        "optional_values",
+        "text_formatting"
+      ],
+      "unlocked_by": null,
+      "uuid": "46da53f3-a39b-4f19-8ade-87f434cf12ec"
+    },
     {
       "core": false,
       "difficulty": 1,

data/tracks/objective-c/exercises/two-fer/TwoFerExample.h

@@ -0,0 +1,15 @@
+//
+//  TwoFerExample.h
+//  xobjectivecTest
+//
+//  Created by Rob Hudson on 11/30/17.
+//  Copyright © 2017 exercism. All rights reserved.
+//
+
+#import <Foundation/Foundation.h>
+
+@interface TwoFer : NSObject
+
++ (nonnull NSString *)twoFerWithName:(nullable NSString *)name;
+
+@end

data/tracks/objective-c/exercises/two-fer/TwoFerExample.m

@@ -0,0 +1,21 @@
+//
+//  TwoFerExample.m
+//  xobjectivecTest
+//
+//  Created by Rob Hudson on 11/30/17.
+//  Copyright © 2017 exercism. All rights reserved.
+//
+
+#import "TwoFerExample.h"
+
+@implementation TwoFer
+
++ (NSString *)twoFerWithName:(NSString *)name {
+    if (!name) {
+        name = @"you"; // !OCLint
+    }
+    
+    return [NSString stringWithFormat:@"One for %@, one for me.", name];
+}
+
+@end

data/tracks/objective-c/exercises/two-fer/TwoFerTest.m

@@ -0,0 +1,31 @@
+#import <XCTest/XCTest.h>
+
+#if __has_include("TwoFerExample.h")
+# import "TwoFerExample.h"
+# else
+# import "TwoFer.h"
+#endif
+
+@interface TwoFerTest : XCTestCase
+
+@end
+
+@implementation TwoFerTest
+
+NS_ASSUME_NONNULL_BEGIN
+    
+- (void)testNoNameGiven {
+    XCTAssertEqualObjects([TwoFer twoFerWithName:nil], @"One for you, one for me.");
+}
+
+- (void)testANameGiven {
+    XCTAssertEqualObjects([TwoFer twoFerWithName:@"Alice"], @"One for Alice, one for me.");
+}
+
+- (void)testAnotherNameGiven {
+    XCTAssertEqualObjects([TwoFer twoFerWithName:@"Bob"], @"One for Bob, one for me.");
+}
+
+NS_ASSUME_NONNULL_END
+    
+@end

data/tracks/objective-c/xcodeProject/ObjectiveC.xcodeproj/project.pbxproj

@@ -79,6 +79,8 @@
 		E951B6B91D429550009EB5B6 /* AllergiesTest.m in Sources */ = {isa = PBXBuildFile; fileRef = E951B6B81D429550009EB5B6 /* AllergiesTest.m */; };
 		E95C52551E81C82A0095D321 /* BinarySearchExample.m in Sources */ = {isa = PBXBuildFile; fileRef = E95C52531E81C82A0095D321 /* BinarySearchExample.m */; };
 		E95C52561E81C82A0095D321 /* BinarySearchTest.m in Sources */ = {isa = PBXBuildFile; fileRef = E95C52541E81C82A0095D321 /* BinarySearchTest.m */; };
+		E9630C491FD07A880024EE90 /* TwoFerExample.m in Sources */ = {isa = PBXBuildFile; fileRef = E9630C481FD07A880024EE90 /* TwoFerExample.m */; };
+		E9630C4B1FD07AA10024EE90 /* TwoFerTest.m in Sources */ = {isa = PBXBuildFile; fileRef = E9630C4A1FD07AA10024EE90 /* TwoFerTest.m */; };
 		E964F68F1FBF9CA6000114D9 /* SayExample.m in Sources */ = {isa = PBXBuildFile; fileRef = E964F68E1FBF9CA6000114D9 /* SayExample.m */; };
 		E964F6911FBF9CC6000114D9 /* SayTest.m in Sources */ = {isa = PBXBuildFile; fileRef = E964F6901FBF9CC6000114D9 /* SayTest.m */; };
 		E96993981DF60E1E009EA223 /* TransposeExample.m in Sources */ = {isa = PBXBuildFile; fileRef = E96993971DF60E1E009EA223 /* TransposeExample.m */; };
@@ -199,6 +201,9 @@
 		E95C52521E81C82A0095D321 /* BinarySearchExample.h */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.h; name = BinarySearchExample.h; path = "../../exercises/binary-search/BinarySearchExample.h"; sourceTree = "<group>"; };
 		E95C52531E81C82A0095D321 /* BinarySearchExample.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = BinarySearchExample.m; path = "../../exercises/binary-search/BinarySearchExample.m"; sourceTree = "<group>"; };
 		E95C52541E81C82A0095D321 /* BinarySearchTest.m */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.c.objc; name = BinarySearchTest.m; path = "../../exercises/binary-search/BinarySearchTest.m"; sourceTree = "<group>"; };
+		E9630C471FD07A880024EE90 /* TwoFerExample.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; name = TwoFerExample.h; path = "../../exercises/two-fer/TwoFerExample.h"; sourceTree = "<group>"; };
+		E9630C481FD07A880024EE90 /* TwoFerExample.m */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.objc; name = TwoFerExample.m; path = "../../exercises/two-fer/TwoFerExample.m"; sourceTree = "<group>"; };
+		E9630C4A1FD07AA10024EE90 /* TwoFerTest.m */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.objc; name = TwoFerTest.m; path = "../../exercises/two-fer/TwoFerTest.m"; sourceTree = "<group>"; };
 		E964F68D1FBF9CA6000114D9 /* SayExample.h */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.h; name = SayExample.h; path = ../../exercises/say/SayExample.h; sourceTree = "<group>"; };
 		E964F68E1FBF9CA6000114D9 /* SayExample.m */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.objc; name = SayExample.m; path = ../../exercises/say/SayExample.m; sourceTree = "<group>"; };
 		E964F6901FBF9CC6000114D9 /* SayTest.m */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.c.objc; name = SayTest.m; path = ../../exercises/say/SayTest.m; sourceTree = "<group>"; };
@@ -299,6 +304,7 @@
 				E99D1D7B1D5532C50006A303 /* SumOfMultiples */,
 				E96993951DF60DF1009EA223 /* Transpose */,
 				E947A4DB1D81FDDA00633720 /* Triangle */,
+				E9630C441FD07A390024EE90 /* TwoFer */,
 				E9E8B6F71D519E3A0012F12C /* WordCount */,
 				1E50BD001CB465C500FC128D /* Info.plist */,
 			);
@@ -462,6 +468,16 @@
 			name = BinarySearch;
 			sourceTree = "<group>";
 		};
+		E9630C441FD07A390024EE90 /* TwoFer */ = {
+			isa = PBXGroup;
+			children = (
+				E9630C471FD07A880024EE90 /* TwoFerExample.h */,
+				E9630C481FD07A880024EE90 /* TwoFerExample.m */,
+				E9630C4A1FD07AA10024EE90 /* TwoFerTest.m */,
+			);
+			name = TwoFer;
+			sourceTree = "<group>";
+		};
 		E964F68C1FBF9B6B000114D9 /* Say */ = {
 			isa = PBXGroup;
 			children = (
@@ -852,6 +868,7 @@
 				A097D4101E363C2700EAF2C2 /* BracketPushTest.m in Sources */,
 				E95C52551E81C82A0095D321 /* BinarySearchExample.m in Sources */,
 				1EFACABC1CCCAF3D006F2E69 /* WordCountTest.m in Sources */,
+				E9630C4B1FD07AA10024EE90 /* TwoFerTest.m in Sources */,
 				1EFACAB11CCCAF3D006F2E69 /* NucleotideCountExample.m in Sources */,
 				E9381D481D8EE00C003F22A1 /* DifferenceOfSquaresTest.m in Sources */,
 				E907FE941D87554500B93DA9 /* ScrabbleScoreTest.m in Sources */,
@@ -888,6 +905,7 @@
 				1EFACAA91CCCAF3D006F2E69 /* GradeSchoolExample.m in Sources */,
 				1EFACABA1CCCAF3D006F2E69 /* SpaceAgeTest.m in Sources */,
 				1EFACAB91CCCAF3D006F2E69 /* SpaceAgeExample.m in Sources */,
+				E9630C491FD07A880024EE90 /* TwoFerExample.m in Sources */,
 				E9F390091DFCA350005C5F46 /* IsogramTest.m in Sources */,
 				E964F6911FBF9CC6000114D9 /* SayTest.m in Sources */,
 				E951B6B71D4294E6009EB5B6 /* AllergiesExample.m in Sources */,

data/tracks/rust/exercises/bob/Cargo.toml

@@ -1,3 +1,3 @@
 [package]
 name = "bob"
-version = "1.0.0"
+version = "1.1.0"

data/tracks/rust/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/rust/exercises/bob/example.rs

@@ -1,5 +1,6 @@
 pub fn reply(message: &str) -> &str {
     if is_silence(message) { "Fine. Be that way!" }
+    else if is_yelling(message) && is_question(message) { "Calm down, I know what I'm doing!" }
     else if is_yelling(message) { "Whoa, chill out!" }
     else if is_question(message) { "Sure." }
     else { "Whatever." }

data/tracks/rust/exercises/bob/tests/bob.rs

@@ -52,7 +52,7 @@ fn test_using_acronyms_in_regular_speech() {
 #[test]
 #[ignore]
 fn test_forceful_question() {
-    assert_eq!("Whoa, chill out!",
+    assert_eq!("Calm down, I know what I'm doing!",
                bob::reply("WHAT THE HELL WERE YOU THINKING?"));
 }
 

data/tracks/rust/exercises/isbn-verifier/README.md

@@ -1,40 +1,45 @@
 # Isbn Verifier
 
-Check if a given ISBN-10 is valid.
+The [ISBN-10 verification process](https://en.wikipedia.org/wiki/International_Standard_Book_Number) is used to validate book identification
+numbers. These normally contain dashes and look like: `3-598-21508-8`
 
-## Functionality
+## ISBN
 
-Given an unknown string the program should check if the provided string is a valid ISBN-10.
-Putting this into place requires some thinking about preprocessing/parsing of the string prior to calculating the check digit for the ISBN.
+The ISBN-10 format is 9 digits (0 to 9) plus one check character (either a digit or an X only). In the case the check character is an X, this represents the value '10'. These may be communicated with or without hyphens, and can be checked for their validity by the following formula:
 
-The program should allow for ISBN-10 without the separating dashes to be verified as well.
+```
+(x1 * 10 + x2 * 9 + x3 * 8 + x4 * 7 + x5 * 6 + x6 * 5 + x7 * 4 + x8 * 3 + x9 * 2 + x10 * 1) mod 11 == 0
+```
 
-## ISBN
+If the result is 0, then it is a valid ISBN-10, otherwise it is invalid.
 
-Let's take a random ISBN-10 number, say `3-598-21508-8` for this.
-The first digit block indicates the group where the ISBN belongs. Groups can consist of shared languages, geographic regions or countries. The leading '3' signals this ISBN is from a german speaking country.
-The following number block is to identify the publisher. Since this is a three digit publisher number there is a 5 digit title number for this book.
-The last digit in the ISBN is the check digit which is used to detect read errors.
+## Example
 
-The first 9 digits in the ISBN have to be between 0 and 9.
-The check digit can additionally be an 'X' to allow 10 to be a valid check digit as well.
+Let's take the ISBN-10 `3-598-21508-8`. We plug it in to the formula, and get:
+```
+(3 * 10 + 5 * 9 + 9 * 8 + 8 * 7 + 2 * 6 + 1 * 5 + 5 * 4 + 0 * 3 + 8 * 2 + 8 * 1) mod 11 == 0
+```
+
+Since the result is 0, this proves that our ISBN is valid.
+
+## Task
+
+Given a string the program should check if the provided string is a valid ISBN-10.
+Putting this into place requires some thinking about preprocessing/parsing of the string prior to calculating the check digit for the ISBN.
 
-A valid ISBN-10 is calculated with this formula `(x1 * 10 + x2 * 9 + x3 * 8 + x4 * 7 + x5 * 6 + x6 * 5 + x7 * 4 + x8 * 3 + x9 * 2 + x10 * 1) mod 11 == 0`
-So for our example ISBN this means:
-(3 * 10 + 5 * 9 + 9 * 8 + 8 * 7 + 2 * 6 + 1 * 5 + 5 * 4 + 0 * 3 + 8 * 2 + 8 * 1) mod 11 = 0
+The program should be able to verify ISBN-10 both with and without separating dashes.
 
-Which proves that the ISBN is valid.
 
 ## Caveats
 
-Converting from string to number can be tricky in certain languages.
-It's getting even trickier since the check-digit of an ISBN-10 can be 'X'.
+Converting from strings to numbers can be tricky in certain languages.
+Now, it's even trickier since the check digit of an ISBN-10 may be 'X' (representing '10'). For instance `3-598-21507-X` is a valid ISBN-10.
 
 ## Bonus tasks
 
-* Generate a valid ISBN-13 from the input ISBN-10 (and maybe verify it again with a derived verifier)
+* Generate a valid ISBN-13 from the input ISBN-10 (and maybe verify it again with a derived verifier).
 
-* Generate valid ISBN, maybe even from a given starting ISBN
+* Generate valid ISBN, maybe even from a given starting ISBN.
 ## Rust Installation
 
 Refer to the [exercism help page][help-page] for Rust installation and learning

data/tracks/typescript/config.json

@@ -541,6 +541,19 @@
             "games",
             "parsing"
         ]
+    },
+    {
+      "uuid": "04de61fb-9fde-461c-b306-0b4ce52e2169",
+      "slug": "atbash-cipher",
+      "core": true,
+      "difficulty": 7,
+      "topics": [
+        "algorithms",
+        "arrays",
+        "control-flow-(conditionals)",
+        "control-flow-(loops)",
+        "text-formatting" 
+      ]
     }
   ],
   "foregone": [],

data/tracks/typescript/exercises/atbash-cipher/README.md

@@ -0,0 +1,60 @@
+# Atbash Cipher
+
+Create an implementation of the atbash cipher, an ancient encryption system created in the Middle East.
+
+The Atbash cipher is a simple substitution cipher that relies on
+transposing all the letters in the alphabet such that the resulting
+alphabet is backwards. The first letter is replaced with the last
+letter, the second with the second-last, and so on.
+
+An Atbash cipher for the Latin alphabet would be as follows:
+
+```text
+Plain:  abcdefghijklmnopqrstuvwxyz
+Cipher: zyxwvutsrqponmlkjihgfedcba
+```
+
+It is a very weak cipher because it only has one possible key, and it is
+a simple monoalphabetic substitution cipher. However, this may not have
+been an issue in the cipher's time.
+
+Ciphertext is written out in groups of fixed length, the traditional group size
+being 5 letters, and punctuation is excluded. This is to make it harder to guess
+things based on word boundaries.
+
+## Examples
+
+- Encoding `test` gives `gvhg`
+- Decoding `gvhg` gives `test`
+- Decoding `gsvjf rxpyi ldmul cqfnk hlevi gsvoz abwlt` gives `thequickbrownfoxjumpsoverthelazydog`
+## 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
+
+Inspired by the Extreme Startup game [https://github.com/rchatley/extreme_startup](https://github.com/rchatley/extreme_startup)
+
+## 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/atbash-cipher/atbash-cipher.example.ts

@@ -0,0 +1,32 @@
+class AtbashCipher {
+    private alphabet: string = "abcdefghijklmnopqrstuvwxyz"
+    private numbers: string = "0123456789"
+
+    public encode(plainText: string) {
+        const lowerCaseLettersOnly = plainText
+            .toLowerCase()
+            .split("")
+            .filter((char) => this.alphabet.includes(char) || this.numbers.includes(char))
+            .join("")
+
+        return this.decode(lowerCaseLettersOnly)
+            .split("")
+            .reduce((accumulator: string[], _, index, array) => {
+                if (index % 5 === 0) {
+                    accumulator.push(array.slice(index, index + 5).join(""))
+                }
+                return accumulator
+            }, [])
+            .join(" ")
+    }
+
+    public decode(cipherText: string) {
+        return cipherText
+            .split(" ").join("")
+            .split("")
+            .map((char) => this.alphabet.includes(char) ? this.alphabet[25 - this.alphabet.indexOf(char)] : char)
+            .join("")
+    }
+}
+
+export default AtbashCipher