trackler 2.2.1.66 → 2.2.1.67

data/tracks/java/exercises/isogram/src/main/java/IsogramChecker.java

@@ -0,0 +1,7 @@
+class IsogramChecker {
+
+    boolean isIsogram(String phrase) {
+        throw new UnsupportedOperationException("Delete this statement and write your own implementation.");
+    }
+
+}

data/tracks/java/exercises/saddle-points/src/main/java/Matrix.java

@@ -0,0 +1,13 @@
+import java.util.List;
+import java.util.Set;
+
+class Matrix {
+
+    Matrix(List<List<Integer>> values) {
+        throw new UnsupportedOperationException("Delete this statement and write your own implementation.");
+    }
+
+    Set<MatrixCoordinate> getSaddlePoints() {
+        throw new UnsupportedOperationException("Delete this statement and write your own implementation.");
+    }
+}

data/tracks/java/exercises/settings.gradle

@@ -32,6 +32,7 @@ include 'hamming'
 include 'hexadecimal'
 include 'hello-world'
 include 'house'
+include 'isbn-verifier'
 include 'isogram'
 include 'kindergarten-garden'
 include 'largest-series-product'

data/tracks/kotlin/config.json

@@ -15,7 +15,7 @@
       "slug": "two-fer",
       "topics": null,
       "unlocked_by": null,
-      "uuid": "fa4194c5-084d-f780-4db6-707ef7bcc30c00e9ee5"
+      "uuid": "40f85461-c256-4b96-8d5b-0509f42fab17"
     },
     {
       "core": false,

data/tracks/ocaml/exercises/all-your-base/example.ml

@@ -7,7 +7,7 @@ let rec to_digits (b: base) (acc: int list) = function
   | n -> to_digits b (n % b :: acc) (n / b)
 
 let convert_bases ~from ~digits ~target =
-  if from <= 1 || target <= 1 || List.is_empty digits
+  if from <= 1 || target <= 1
   then None
   else
     let open Option.Monad_infix in

data/tracks/ocaml/exercises/all-your-base/test.ml

@@ -1,4 +1,4 @@
-(* Test/exercise version: "1.1.0" *)
+(* Test/exercise version: "2.0.1" *)
 
 open Core
 open OUnit2
@@ -29,28 +29,28 @@ let tests = [
   "15-bit integer" >::
     ae (Some [6; 10; 45]) (convert_bases ~from:97 ~digits:[3; 46; 60] ~target:73);
   "empty list" >::
-    ae None (convert_bases ~from:2 ~digits:[] ~target:10);
+    ae (Some [0]) (convert_bases ~from:2 ~digits:[] ~target:10);
   "single zero" >::
     ae (Some [0]) (convert_bases ~from:10 ~digits:[0] ~target:2);
   "multiple zeros" >::
     ae (Some [0]) (convert_bases ~from:10 ~digits:[0; 0; 0] ~target:2);
   "leading zeros" >::
-    ae (Some [4;2]) (convert_bases ~from:7 ~digits:[0; 6; 0] ~target:10);
-  "first base is one" >::
+    ae (Some [4; 2]) (convert_bases ~from:7 ~digits:[0; 6; 0] ~target:10);
+  "input base is one" >::
     ae None (convert_bases ~from:1 ~digits:[] ~target:10);
-  "first base is zero" >::
+  "input base is zero" >::
     ae None (convert_bases ~from:0 ~digits:[] ~target:10);
-  "first base is negative" >::
+  "input base is negative" >::
     ae None (convert_bases ~from:(-2) ~digits:[1] ~target:10);
   "negative digit" >::
     ae None (convert_bases ~from:2 ~digits:[1; -1; 1; 0; 1; 0] ~target:10);
   "invalid positive digit" >::
     ae None (convert_bases ~from:2 ~digits:[1; 2; 1; 0; 1; 0] ~target:10);
-  "second base is one" >::
+  "output base is one" >::
     ae None (convert_bases ~from:2 ~digits:[1; 0; 1; 0; 1; 0] ~target:1);
-  "second base is zero" >::
+  "output base is zero" >::
     ae None (convert_bases ~from:10 ~digits:[7] ~target:0);
-  "second base is negative" >::
+  "output base is negative" >::
     ae None (convert_bases ~from:2 ~digits:[1] ~target:(-7));
   "both bases are negative" >::
     ae None (convert_bases ~from:(-2) ~digits:[1] ~target:(-7));

data/tracks/perl6/config.json

@@ -233,7 +233,7 @@
       "slug": "anagram",
       "core": false,
       "unlocked_by": null,
-      "difficulty": 5,
+      "difficulty": 4,
       "topics": [
 
       ]

data/tracks/perl6/docs/SNIPPET.txt

@@ -1,6 +1,6 @@
 say my $candidates = all
-  (‘Alphabet’, ‘subdermatoglyphic’,
-  ‘Emily Jung Schwartzkopf’).pick: 2;
+  «Alphabet subdermatoglyphic
+  ‘Emily Jung Schwartzkopf’».pick: 2;
 
 say “All isograms? {$_ ?? ‘✔’ !! ‘❌’}”
   given is-isogram($candidates).so;

data/tracks/perl6/exercises/anagram/Anagram.pm6

@@ -1 +1,4 @@
-unit module Anagram:ver<1>;
+unit module Anagram:ver<2>;
+
+sub match-anagrams (:$subject!, :@candidates!) is export {
+}

data/tracks/perl6/exercises/anagram/Example.pm6

@@ -1,18 +1,7 @@
-unit module Anagram:ver<1>;
+unit module Anagram:ver<2>;
 
-sub match-anagrams ($word, @words) is export {
-  my @results;
-  my $canonical = canonize($word);
-  for @words -> $w {
-    next if $w.lc eq $word.lc;
-    my $try = canonize($w);
-    if $try eq $canonical {
-      @results.push: $w;
-    }
+sub match-anagrams ( :$subject!, :@candidates! ) is export {
+  given $subject.uc -> $ucs {
+    @candidates.grep: { given .uc {$_ ne $ucs && .comb ~~ $ucs.comb.Bag} }
   }
-  @results;
-}
-
-sub canonize ($str) {
-  (($str.lc.split('')).sort).join('');
 }

data/tracks/perl6/exercises/anagram/anagram.t

@@ -5,7 +5,7 @@ use lib my $dir = $?FILE.IO.dirname;
 use JSON::Fast;
 
 my Str:D $exercise := 'Anagram';
-my Version:D $version = v1;
+my Version:D $version = v2;
 my Str $module //= $exercise;
 plan 18;
 
@@ -22,7 +22,7 @@ if ::($exercise).^ver !~~ $version {
 require ::($module) <&match-anagrams>;
 
 my $c-data = from-json $=pod.pop.contents;
-is match-anagrams(|.<subject candidates>), |.<expected description> for @($c-data<cases>);
+cmp-ok match-anagrams( |%(.<subject candidates>:p) ), '~~', .<expected>.Set, .<description> for $c-data<cases>.values;
 
 =head2 Canonical Data
 =begin code

data/tracks/perl6/exercises/anagram/example.yaml

@@ -1,25 +1,17 @@
 exercise: Anagram
-version: 1
+version: 2
 plan: 18
 imports: '&match-anagrams'
 tests: |-
-  is match-anagrams(|.<subject candidates>), |.<expected description> for @($c-data<cases>);
+  cmp-ok match-anagrams( |%(.<subject candidates>:p) ), '~~', .<expected>.Set, .<description> for $c-data<cases>.values;
 
 unit: module
 example: |-
-  sub match-anagrams ($word, @words) is export {
-    my @results;
-    my $canonical = canonize($word);
-    for @words -> $w {
-      next if $w.lc eq $word.lc;
-      my $try = canonize($w);
-      if $try eq $canonical {
-        @results.push: $w;
-      }
+  sub match-anagrams ( :$subject!, :@candidates! ) is export {
+    given $subject.uc -> $ucs {
+      @candidates.grep: { given .uc {$_ ne $ucs && .comb ~~ $ucs.comb.Bag} }
     }
-    @results;
   }
-
-  sub canonize ($str) {
-    (($str.lc.split('')).sort).join('');
+stub: |-
+  sub match-anagrams (:$subject!, :@candidates!) is export {
   }

data/tracks/php/config.json

@@ -48,6 +48,18 @@
         "Control-flow (if-else statements)"
       ]
     },
+    {
+      "uuid": "0a453685-55c2-47e2-88b2-e26d1d8fbde9",
+      "slug": "run-length-encoding",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 1,
+      "topics": [
+        "strings",
+        "algorithms",
+        "text_formatting"
+      ]
+    },
     {
       "uuid": "4f15fc17-f68e-43bc-9417-403dd6d03f4f",
       "slug": "pangram",

data/tracks/php/exercises/run-length-encoding/README.md

@@ -0,0 +1,42 @@
+# Run Length Encoding
+
+Implement run-length encoding and decoding.
+
+Run-length encoding (RLE) is a simple form of data compression, where runs
+(consecutive data elements) are replaced by just one data value and count.
+
+For example we can represent the original 53 characters with only 13.
+
+```text
+"WWWWWWWWWWWWBWWWWWWWWWWWWBBBWWWWWWWWWWWWWWWWWWWWWWWWB"  ->  "12WB12W3B24WB"
+```
+
+RLE allows the original data to be perfectly reconstructed from
+the compressed data, which makes it a lossless data compression.
+
+```text
+"AABCCCDEEEE"  ->  "2AB3CD4E"  ->  "AABCCCDEEEE"
+```
+
+For simplicity, you can assume that the unencoded string will only contain
+the letters A through Z (either lower or upper case) and whitespace. This way
+data to be encoded will never contain any numbers and numbers inside data to
+be decoded always represent the count for the following character.
+
+## Submitting Exercises
+
+1. Get [PHPUnit].
+
+        % wget --no-check-certificate https://phar.phpunit.de/phpunit.phar
+        % chmod +x phpunit.phar
+
+2. Execute the tests for an assignment.
+
+        % phpunit.phar run-length-encoding/run-length-encoding_test.php
+
+## Source
+
+Wikipedia [https://en.wikipedia.org/wiki/Run-length_encoding](https://en.wikipedia.org/wiki/Run-length_encoding)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/php/exercises/run-length-encoding/example.php

@@ -0,0 +1,60 @@
+<?php
+
+/**
+ * @param string $input
+ * @return string
+ */
+function encode($input)
+{
+    if (!$input) {
+        return '';
+    }
+
+    $output = '';
+    $prev = $letter = null;
+    $count = 1;
+
+    foreach (str_split($input) as $letter) {
+        if ($letter === $prev) {
+            $count++;
+        } else {
+            if ($count > 1) {
+                $output .= $count;
+            }
+            $output .= $prev;
+            $count = 1;
+        }
+
+        $prev = $letter;
+    }
+
+    if ($count > 1) {
+        $output .= $count;
+    }
+    $output .= $letter;
+
+    return $output;
+}
+
+/**
+ * @param string $input
+ * @return string
+ */
+function decode($input)
+{
+    $output = '';
+    preg_match_all('/([1-9]*)(\w|\s)/', $input, $matches);
+
+    $length = count($matches[0]);
+    for ($i = 0; $i < $length; $i++) {
+        $count = $matches[1][$i];
+        if ($count === '') {
+            $count = 1;
+        }
+        $letter = $matches[2][$i];
+
+        $output .= str_repeat($letter, (int) $count);
+    }
+
+    return $output;
+}

data/tracks/php/exercises/run-length-encoding/run-length-encoding.php

@@ -0,0 +1,20 @@
+<?php
+
+//
+// This is only a SKELETON file for the "Run Length Encoding" exercise. It's been provided as a
+// convenience to get you started writing code faster.
+//
+
+function encode($input)
+{
+    //
+    // YOUR CODE GOES HERE
+    //
+}
+
+function decode($input)
+{
+    //
+    // YOUR CODE GOES HERE
+    //
+}

data/tracks/php/exercises/run-length-encoding/run-length-encoding_test.php

@@ -0,0 +1,65 @@
+<?php
+
+require "run-length-encoding.php";
+
+/**
+ * Class RunLengthEncodingTest
+ */
+class RunLengthEncodingTest extends PHPUnit\Framework\TestCase
+{
+    public function testEncodeEmptyString()
+    {
+        $this->assertEquals('', encode(''));
+    }
+
+    public function testEncodeSingleCharactersOnly()
+    {
+        $this->assertEquals('XYZ', encode('XYZ'));
+    }
+
+    public function testDecodeEmptyString()
+    {
+        $this->assertEquals('', decode(''));
+    }
+
+    public function testDecodeSingleCharactersOnly()
+    {
+        $this->assertEquals('XYZ', decode('XYZ'));
+    }
+
+    public function testEncodeSimple()
+    {
+        $this->assertEquals('2A3B4C', encode('AABBBCCCC'));
+    }
+
+    public function testDecodeSimple()
+    {
+        $this->assertEquals('AABBBCCCC', decode('2A3B4C'));
+    }
+
+    public function testEncodeWithSingleValues()
+    {
+        $this->assertEquals(
+            '12WB12W3B24WB',
+            encode('WWWWWWWWWWWWBWWWWWWWWWWWWBBBWWWWWWWWWWWWWWWWWWWWWWWWB')
+        );
+    }
+
+    public function testDecodeWithSingleValues()
+    {
+        $this->assertEquals(
+            'WWWWWWWWWWWWBWWWWWWWWWWWWBBBWWWWWWWWWWWWWWWWWWWWWWWWB',
+            decode('12WB12W3B24WB')
+        );
+    }
+
+    public function testDecodeMultipleWhitespaceMixedInString()
+    {
+        $this->assertEquals('  hsqq qww  ', decode('2 hs2q q2w2 '));
+    }
+
+    public function testEncodeDecodeCombination()
+    {
+        $this->assertEquals('zzz ZZ  zZ', decode(encode('zzz ZZ  zZ')));
+    }
+}

data/tracks/purescript/.travis.yml

@@ -11,7 +11,7 @@ script:
   - bin/fetch-configlet
   - bin/configlet --track-id purescript lint .
   - bin/check-bower.sh
-  - bin/test.sh
+  - LIMIT_CORES=1 bin/test.sh
 
 cache:
   directories:

data/tracks/purescript/bin/test.sh

@@ -58,7 +58,14 @@ node etc/test-module-updater.js $work_dir/test
 cd $work_dir
 
 time bower install
-time pulp test
+
+# CI reports that we can use more cores than we can, so limit
+# the number we attempt to use to prevent slowdown on CI.
+if [[ -z "$LIMIT_CORES" ]]; then
+  time pulp test -j 2
+else
+  time pulp test
+fi
 
 test_result=$?
 
@@ -71,4 +78,4 @@ else
   echo -e "\e[1;31m[ Some tests have failed ]\e[0;39m"
 fi
 
-exit $test_result
+exit $test_result

data/tracks/python/config.json

@@ -1,5 +1,6 @@
 {
   "language": "Python",
+  "blurb": "Python is a clear and powerful object-oriented programming language with an elegant and easy-to-read syntax. It is ideal for prototyping and ad-hoc tasks, but also sees wide use in scientific computing, web development, and automation.",
   "active": true,
   "exercises": [
     {
@@ -54,20 +55,6 @@
         "logic"
       ]
     },
-    {
-      "uuid": "c4754efd-6d67-48bd-994e-4b07a217ffc3",
-      "slug": "parallel-letter-frequency",
-      "core": false,
-      "unlocked_by": null,
-      "difficulty": 5,
-      "topics": [
-        "threading",
-        "parallellism",
-        "loops",
-        "queues",
-        "strings"
-      ]
-    },
     {
       "uuid": "ca7c5ef1-5135-4fb4-8e68-669ef0f2a51a",
       "slug": "rna-transcription",
@@ -1105,6 +1092,8 @@
     {
       "uuid": "6f530d0c-d13e-4270-b120-e42c16691a66",
       "slug": "two-bucket",
+      "core": false,
+      "unlocked_by": null,
       "difficulty": 5,
       "topics": [
         "algorithms",
@@ -1115,6 +1104,8 @@
     {
       "uuid": "88610b9a-6d3e-4924-a092-6d2f907ed4e2",
       "slug": "markdown",
+      "core": false,
+      "unlocked_by": null,
       "difficulty": 3,
       "topics": [
         "refactoring"
@@ -1201,7 +1192,7 @@
       ]
     },
     {
-      "uuid": "6f196341-0ffc-9780-a7ca-1f817508247161cbcd9",
+      "uuid": "df7cd9b9-283a-4466-accf-98c4a7609450",
       "slug": "binary-search-tree",
       "core": false,
       "unlocked_by": null,
@@ -1271,6 +1262,6 @@
     }
   ],
   "foregone": [
-
+      "parallel-letter-frequency"
   ]
 }