trackler 2.2.1.98 → 2.2.1.99

data/tracks/java/exercises/largest-series-product/.meta/src/reference/java/LargestSeriesProductCalculator.java

@@ -33,9 +33,7 @@ final class LargestSeriesProductCalculator {
     }
 
     private void validateStringToSearch() throws IllegalArgumentException {
-        if (stringToSearch == null) {
-            throw new IllegalArgumentException("String to search must be non-null.");
-        } else if (!stringToSearch.chars().allMatch(Character::isDigit)) {
+        if (!stringToSearch.chars().allMatch(Character::isDigit)) {
             throw new IllegalArgumentException("String to search may only contain digits.");
         }
     }

data/tracks/java/exercises/largest-series-product/.meta/version

@@ -0,0 +1 @@
+1.1.0

data/tracks/java/exercises/largest-series-product/src/test/java/LargestSeriesProductCalculatorTest.java

@@ -11,9 +11,9 @@ public class LargestSeriesProductCalculatorTest {
     public ExpectedException expectedException = ExpectedException.none();
 
     @Test
-    public void testCorrectlyCalculatesLargestProductOfLengthTwoWithNumbersInOrder() {
-        final LargestSeriesProductCalculator calculator = new LargestSeriesProductCalculator("0123456789");
-        final long expectedProduct = 72;
+    public void testCorrectlyCalculatesLargestProductWhenSeriesLengthEqualsStringToSearchLength() {
+        final LargestSeriesProductCalculator calculator = new LargestSeriesProductCalculator("29");
+        final long expectedProduct = 18;
 
         final long actualProduct = calculator.calculateLargestProductForSeriesLength(2);
 
@@ -22,9 +22,9 @@ public class LargestSeriesProductCalculatorTest {
 
     @Ignore("Remove to run test")
     @Test
-    public void testCorrectlyCalculatesLargestProductOfLengthTwoWithNumbersNotInOrder() {
-        final LargestSeriesProductCalculator calculator = new LargestSeriesProductCalculator("576802143");
-        final long expectedProduct = 48;
+    public void testCorrectlyCalculatesLargestProductOfLengthTwoWithNumbersInOrder() {
+        final LargestSeriesProductCalculator calculator = new LargestSeriesProductCalculator("0123456789");
+        final long expectedProduct = 72;
 
         final long actualProduct = calculator.calculateLargestProductForSeriesLength(2);
 
@@ -33,9 +33,9 @@ public class LargestSeriesProductCalculatorTest {
 
     @Ignore("Remove to run test")
     @Test
-    public void testCorrectlyCalculatesLargestProductWhenSeriesLengthEqualsStringToSearchLength() {
-        final LargestSeriesProductCalculator calculator = new LargestSeriesProductCalculator("29");
-        final long expectedProduct = 18;
+    public void testCorrectlyCalculatesLargestProductOfLengthTwoWithNumbersNotInOrder() {
+        final LargestSeriesProductCalculator calculator = new LargestSeriesProductCalculator("576802143");
+        final long expectedProduct = 48;
 
         final long actualProduct = calculator.calculateLargestProductForSeriesLength(2);
 
@@ -88,32 +88,6 @@ public class LargestSeriesProductCalculatorTest {
         assertEquals(expectedProduct, actualProduct);
     }
 
-    @Ignore("Remove to run test")
-    @Test
-    public void testCorrectlyCalculatesLargestProductInLongStringToSearchV2() {
-        final LargestSeriesProductCalculator calculator
-                = new LargestSeriesProductCalculator("52677741234314237566414902593461595376319419139427");
-
-        final long expectedProduct = 28350;
-
-        final long actualProduct = calculator.calculateLargestProductForSeriesLength(6);
-
-        assertEquals(expectedProduct, actualProduct);
-    }
-
-    @Ignore("Remove to run test")
-    @Test
-    public void testCorrectlyCalculatesLargestProductInLongStringToSearchFromProjectEuler() {
-        final LargestSeriesProductCalculator calculator
-                = new LargestSeriesProductCalculator("7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450");
-
-        final long expectedProduct = 23514624000L;
-
-        final long actualProduct = calculator.calculateLargestProductForSeriesLength(13);
-
-        assertEquals(expectedProduct, actualProduct);
-    }
-
     @Ignore("Remove to run test")
     @Test
     public void testCorrectlyCalculatesLargestProductOfZeroIfAllDigitsAreZeroes() {
@@ -202,13 +176,4 @@ public class LargestSeriesProductCalculatorTest {
         calculator.calculateLargestProductForSeriesLength(-1);
     }
 
-    @Ignore("Remove to run test")
-    @Test
-    public void testNullStringToSearchIsRejected() {
-        expectedException.expect(IllegalArgumentException.class);
-        expectedException.expectMessage("String to search must be non-null.");
-
-        new LargestSeriesProductCalculator(null);
-    }
-
 }

data/tracks/ocaml/exercises/grade-school/.meta/description.md

@@ -0,0 +1,21 @@
+Given students' names along with the grade that they are in, create a roster
+for the school.
+
+In the end, you should be able to:
+
+- Start with an empty school.
+- Add a student's name to the roster for a grade
+  - "Add Jim to grade 2."
+  - "OK."
+- Get a list of all students enrolled in a grade
+  - "Which students are in grade 2?"
+  - "We've only got Jim just now."
+- Get a sorted list of all students in all grades.  Grades should sort
+  as 1, 2, 3, etc., and students within a grade should be sorted
+  alphabetically by name.
+  - "Who all is enrolled in school right now?"
+  - "Grade 1: Anna, Barb, and Charlie. Grade 2: Alex, Peter, and Zoe.
+    Grade 3…"
+
+Note that all our students only have one name.  (It's a small town, what
+do you want?)

data/tracks/ocaml/exercises/palindrome-products/.meta/description.md

@@ -0,0 +1,35 @@
+Detect palindrome products in a given range.
+
+A palindromic number is a number that remains the same when its digits are
+reversed. For example, `121` is a palindromic number but `112` is not.
+
+Given a range of numbers, find the largest and smallest palindromes which
+are products of numbers within that range.
+
+Your solution should return the largest and smallest palindromes, along with the
+factors of each within the range. If the largest or smallest palindrome has more
+than one pair of factors within the range, then return all the pairs.
+
+Not all ranges of factors can produce a Palindrome, and ranges must have their
+max at least as large as their min. This exercise uses the OCaml `Result.t`
+type to specify errors.
+
+## Example 1
+
+Given the range `[1, 9]` (both inclusive)...
+
+And given the list of all possible products within this range:
+`[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 16, 18, 15, 21, 24, 27, 20, 28, 32, 36, 25, 30, 35, 40, 45, 42, 48, 54, 49, 56, 63, 64, 72, 81]`
+
+The palindrome products are all single digit numbers (in this case):
+`[1, 2, 3, 4, 5, 6, 7, 8, 9]`
+
+The smallest palindrome product is `1`. Its factors are `(1, 1)`.
+The largest palindrome product is `9`. Its factors are `(1, 9)` and `(3, 3)`.
+
+## Example 2
+
+Given the range `[10, 99]` (both inclusive)...
+
+The smallest palindrome product is `121`. Its factors are `(11, 11)`.
+The largest palindrome product is `9009`. Its factors are `(91, 99)`.

data/tracks/ocaml/exercises/palindrome-products/README.md

@@ -9,26 +9,32 @@ Given a range of numbers, find the largest and smallest palindromes which
 are products of numbers within that range.
 
 Your solution should return the largest and smallest palindromes, along with the
-factors of each within the range. If the largest or smallest palindrome has more 
+factors of each within the range. If the largest or smallest palindrome has more
 than one pair of factors within the range, then return all the pairs.
 
-Not all ranges of factors can produce a Palindrome, and ranges must have their 
-max at least as large as their min. This exercise uses the OCaml `Result.t` 
+Not all ranges of factors can produce a Palindrome, and ranges must have their
+max at least as large as their min. This exercise uses the OCaml `Result.t`
 type to specify errors.
 
 ## Example 1
 
 Given the range `[1, 9]` (both inclusive)...
 
-The smallest product is `1`. Its factors are `(1, 1)`.
-The largest product is `9`. Its factors are `(1, 9)`, and `(3, 3)`.
+And given the list of all possible products within this range:
+`[1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 16, 18, 15, 21, 24, 27, 20, 28, 32, 36, 25, 30, 35, 40, 45, 42, 48, 54, 49, 56, 63, 64, 72, 81]`
+
+The palindrome products are all single digit numbers (in this case):
+`[1, 2, 3, 4, 5, 6, 7, 8, 9]`
+
+The smallest palindrome product is `1`. Its factors are `(1, 1)`.
+The largest palindrome product is `9`. Its factors are `(1, 9)` and `(3, 3)`.
 
 ## Example 2
 
 Given the range `[10, 99]` (both inclusive)...
 
 The smallest palindrome product is `121`. Its factors are `(11, 11)`.
-The largest palindrome product is `9009`. Its factors are `(91, 99)` and `(99, 91)`.
+The largest palindrome product is `9009`. Its factors are `(91, 99)`.
 
 
 ## Getting Started
@@ -71,9 +77,7 @@ one, head over there and create an issue.  We'll do our best to help you!
 
 ## Source
 
-Problem 4 at Project Euler
-
-Wikipedia [http://projecteuler.net/problem=4](http://projecteuler.net/problem=4)
+Problem 4 at Project Euler [http://projecteuler.net/problem=4](http://projecteuler.net/problem=4)
 
 ## Submitting Incomplete Solutions
 It's possible to submit an incomplete solution so you can see how others have completed the exercise.

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: trackler
 version: !ruby/object:Gem::Version
-  version: 2.2.1.98
+  version: 2.2.1.99
 platform: ruby
 authors:
 - Katrina Owen
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2018-01-21 00:00:00.000000000 Z
+date: 2018-01-22 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rubyzip
@@ -5182,6 +5182,12 @@ files:
 - tracks/fsharp/exercises/collatz-conjecture/Example.fs
 - tracks/fsharp/exercises/collatz-conjecture/Program.fs
 - tracks/fsharp/exercises/collatz-conjecture/README.md
+- tracks/fsharp/exercises/complex-numbers/ComplexNumbers.fs
+- tracks/fsharp/exercises/complex-numbers/ComplexNumbers.fsproj
+- tracks/fsharp/exercises/complex-numbers/ComplexNumbersTest.fs
+- tracks/fsharp/exercises/complex-numbers/Example.fs
+- tracks/fsharp/exercises/complex-numbers/Program.fs
+- tracks/fsharp/exercises/complex-numbers/README.md
 - tracks/fsharp/exercises/connect/Connect.fs
 - tracks/fsharp/exercises/connect/Connect.fsproj
 - tracks/fsharp/exercises/connect/ConnectTest.fs
@@ -6172,6 +6178,11 @@ files:
 - tracks/go/exercises/queen-attack/README.md
 - tracks/go/exercises/queen-attack/example.go
 - tracks/go/exercises/queen-attack/queen_attack_test.go
+- tracks/go/exercises/rail-fence-cipher/.meta/gen.go
+- tracks/go/exercises/rail-fence-cipher/README.md
+- tracks/go/exercises/rail-fence-cipher/cases_test.go
+- tracks/go/exercises/rail-fence-cipher/example.go
+- tracks/go/exercises/rail-fence-cipher/rail_fence_cipher_test.go
 - tracks/go/exercises/raindrops/.meta/gen.go
 - tracks/go/exercises/raindrops/.meta/hints.md
 - tracks/go/exercises/raindrops/README.md
@@ -7510,6 +7521,7 @@ files:
 - tracks/java/exercises/kindergarten-garden/src/main/java/Plant.java
 - tracks/java/exercises/kindergarten-garden/src/test/java/KindergartenGardenTest.java
 - tracks/java/exercises/largest-series-product/.meta/src/reference/java/LargestSeriesProductCalculator.java
+- tracks/java/exercises/largest-series-product/.meta/version
 - tracks/java/exercises/largest-series-product/README.md
 - tracks/java/exercises/largest-series-product/build.gradle
 - tracks/java/exercises/largest-series-product/src/main/java/LargestSeriesProductCalculator.java
@@ -9725,6 +9737,7 @@ files:
 - tracks/ocaml/exercises/forth/forth.mli
 - tracks/ocaml/exercises/forth/test.ml
 - tracks/ocaml/exercises/grade-school/.merlin
+- tracks/ocaml/exercises/grade-school/.meta/description.md
 - tracks/ocaml/exercises/grade-school/Makefile
 - tracks/ocaml/exercises/grade-school/README.md
 - tracks/ocaml/exercises/grade-school/example.ml
@@ -9792,6 +9805,7 @@ files:
 - tracks/ocaml/exercises/nucleotide-count/nucleotide_count.mli
 - tracks/ocaml/exercises/nucleotide-count/test.ml
 - tracks/ocaml/exercises/palindrome-products/.merlin
+- tracks/ocaml/exercises/palindrome-products/.meta/description.md
 - tracks/ocaml/exercises/palindrome-products/Makefile
 - tracks/ocaml/exercises/palindrome-products/README.md
 - tracks/ocaml/exercises/palindrome-products/example.ml