trackler 2.2.1.45 → 2.2.1.46

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: f8ac63f9d9879908b1ca0ab3dda476f7667b5e3f
-  data.tar.gz: a76b44ecb738925f195c51ff2d76e96e3a90cdf2
+  metadata.gz: 577f87c31f6686218362bd5f88c107e97a078b6b
+  data.tar.gz: d79f4cb9946c6dd05880ed312f61898d24b6b26a
 SHA512:
-  metadata.gz: ca3f20d638ef6e3247071737bef5d49204a311afa239f2277711a1c64ae2412ac288663606dfa5945d1f69db487c4f1a3c2c9765b4fbe3f129bce2ec18887920
-  data.tar.gz: a452673c796caa127a4b9138cdca6c02f9f9091b47e2cc3163fbb8ebbee1b0837a8e1e72db4c4a0e6c1e761bef17b8e0657b6323bf7c51bcfbde30e0aebbec77
+  metadata.gz: b1f8bb44a3a386fe1e419e1aaf6d0d94b25eced11c01d714e1407574444e1fc088f2dd727d100482e381b47c833ef12ba39a9f76c5b295bae48e794ce0bd6770
+  data.tar.gz: 8a9234a9b05ae2a18047c8c97c7e96bcd6211a711fd0433809404849b1ea90d20bb5554132ed860eb09fc4befc0a02509639f56dc7a3d8446670dd1420efe836

data/lib/trackler/version.rb

@@ -1,3 +1,3 @@
 module Trackler
-  VERSION = "2.2.1.45"
+  VERSION = "2.2.1.46"
 end

data/problem-specifications/exercises/complex-numbers/description.md

@@ -1,3 +1,30 @@
 A complex number is a number in the form `a + b * i` where `a` and `b` are real and `i` satisfies `i^2 = -1`.
 
+`a` is called the real part and `b` is called the imaginary part of `z`.
+The conjugate of the number `a + b * i` is the number `a - b * i`.
+The absolute value of a complex number `z = a + b * i` is a real number `|z| = sqrt(a^2 + b^2)`. The square of the absolute value `|z|^2` is the result of multiplication of `z` by its complex conjugate.
+
+The sum/difference of two complex numbers involves adding/subtracting their real and imaginary parts separately:
+`(a + i * b) + (c + i * d) = (a + c) + (b + d) * i`,
+`(a + i * b) - (c + i * d) = (a - c) + (b - d) * i`.
+
+Multiplication result is by definition
+`(a + i * b) * (c + i * d) = (a * c - b * d) + (b * c + a * d) * i`.
+
+The reciprocal of a non-zero complex number is
+`1 / (a + i * b) = a/(a^2 + b^2) - b/(a^2 + b^2) * i`.
+
+Dividing a complex number `a + i * b` by another `c + i * d` gives:
+`(a + i * b) / (c + i * d) = (a * c + b * d)/(c^2 + d^2) + (b * c - a * d)/(c^2 + d^2) * i`.
+
+Exponent of a complex number can be expressed as
+`exp(a + i * b) = exp(a) * exp(i * b)`,
+and the last term is given by Euler's formula `exp(i * b) = cos(b) + i * sin(b)`.
+
+
+Implement the following operations:
+ - addition, subtraction, multiplication and division of two complex numbers,
+ - conjugate, absolute value, exponent of a given complex number.
+
+
 Assume the programming language you are using does not have an implementation of complex numbers.

data/problem-specifications/exercises/crypto-square/canonical-data.json

@@ -1,52 +1,48 @@
 {
   "exercise": "crypto-square",
-  "version": "3.0.0",
+  "version": "3.1.0",
   "cases": [
     {
-      "description": "the spaces and punctuation are removed from the English text and the message is downcased",
-      "cases": [
-        {
-          "description": "Lowercase",
-          "property": "ciphertext",
-          "plaintext": "A",
-          "expected": "a"
-        },
-        {
-          "description": "Remove spaces",
-          "property": "ciphertext",
-          "plaintext": "  b ",
-          "expected": "b"
-        },
-        {
-          "description": "Remove punctuation",
-          "property": "ciphertext",
-          "plaintext": "@1,%!",
-          "expected": "1"
-        }
-      ]
+      "description": "empty plaintext results in an empty ciphertext",
+      "property": "ciphertext",
+      "plaintext": "",
+      "expected": ""
     },
     {
-      "description": "Output the encoded text in chunks.  Phrases that fill perfect squares `(r X r)` should be output in `r`-length chunks separated by spaces.  Imperfect squares will have `n` empty spaces.  Those spaces should be distributed evenly across the last `n` rows.",
-      "cases": [
-        {
-          "description": "empty plaintext results in an empty ciphertext",
-          "property": "ciphertext",
-          "plaintext": "",
-          "expected": ""
-        },
-        {
-          "description": "9 character plaintext results in 3 chunks of 3 characters",
-          "property": "ciphertext",
-          "plaintext": "This is fun!",
-          "expected": "tsf hiu isn"
-        },
-        {
-          "description": "54 character plaintext results in 7 chunks, the last two padded with spaces",
-          "property": "ciphertext",
-          "plaintext": "If man was meant to stay on the ground, god would have given us roots.",
-          "expected": "imtgdvs fearwer mayoogo anouuio ntnnlvt wttddes aohghn  sseoau "
-        }
-      ]
+      "description": "Lowercase",
+      "property": "ciphertext",
+      "plaintext": "A",
+      "expected": "a"
+    },
+    {
+      "description": "Remove spaces",
+      "property": "ciphertext",
+      "plaintext": "  b ",
+      "expected": "b"
+    },
+    {
+      "description": "Remove punctuation",
+      "property": "ciphertext",
+      "plaintext": "@1,%!",
+      "expected": "1"
+    },
+    {
+      "description": "9 character plaintext results in 3 chunks of 3 characters",
+      "property": "ciphertext",
+      "plaintext": "This is fun!",
+      "expected": "tsf hiu isn"
+    },
+    {
+      "description": "8 character plaintext results in 3 chunks, the last one with a trailing space",
+      "property": "ciphertext",
+      "plaintext": "Chill out.",
+      "expected": "clu hlt io "
+    },
+    {
+      "description": "54 character plaintext results in 7 chunks, the last two with trailing spaces",
+      "property": "ciphertext",
+      "plaintext": "If man was meant to stay on the ground, god would have given us roots.",
+      "expected": "imtgdvs fearwer mayoogo anouuio ntnnlvt wttddes aohghn  sseoau "
     }
   ]
 }

data/problem-specifications/exercises/crypto-square/description.md

@@ -43,12 +43,14 @@ The message above is coded as:
 imtgdvsfearwermayoogoanouuiontnnlvtwttddesaohghnsseoau
 ```
 
-Output the encoded text in chunks.  Phrases that fill perfect squares
-`(r X r)` should be output in `r`-length chunks separated by spaces.
-Imperfect squares will have `n` empty spaces.  Those spaces should be distributed evenly across the last `n` rows.
+Output the encoded text in chunks.  Phrases that fill perfect rectangles
+`(r X c)` should be output `c` chunks of `r` length, separated by spaces.
+Phrases that do not fill perfect rectangles will have `n` empty spaces.
+Those spaces should be distributed evenly, added to the end of the last
+`n` chunks.
 
 ```text
-imtgdvs fearwer mayoogo anouuio ntnnlvt wttddes aohghn sseoau
+imtgdvs fearwer mayoogo anouuio ntnnlvt wttddes aohghn  sseoau 
 ```
 
 Notice that were we to stack these, we could visually decode the

data/problem-specifications/exercises/hamming/canonical-data.json

@@ -1,6 +1,6 @@
 {
 "exercise": "hamming",
-"version": "2.0.0",
+"version": "2.0.1",
   "comments": [
     "Language implementations vary on the issue of unequal length strands.",
     "A language may elect to simplify this task by only presenting equal",
@@ -73,15 +73,15 @@
     {
       "description": "non-unique character in first strand",
       "property": "distance",
-      "strand1": "AGA",
-      "strand2": "AGG",
+      "strand1": "AAG",
+      "strand2": "AAA",
       "expected": 1
     },
     {
       "description": "non-unique character in second strand",
       "property": "distance",
-      "strand1": "AGG",
-      "strand2": "AGA",
+      "strand1": "AAA",
+      "strand2": "AAG",
       "expected": 1
     },
     {

data/problem-specifications/exercises/kindergarten-garden/description.md

@@ -1,19 +1,19 @@
 Given a diagram, determine which plants each child in the kindergarten class is
 responsible for.
 
-The kindergarten class is learning about growing plants. The teachers
+The kindergarten class is learning about growing plants. The teacher
 thought it would be a good idea to give them actual seeds, plant them in
 actual dirt, and grow actual plants.
 
 They've chosen to grow grass, clover, radishes, and violets.
 
-To this end, they've put little styrofoam cups along the window sills,
-and planted one type of plant in each cup, choosing randomly from the
-available types of seeds.
+To this end, the children have put little cups along the window sills, and 
+planted one type of plant in each cup, choosing randomly from the available 
+types of seeds.
 
 ```text
 [window][window][window]
-........................ # each dot represents a styrofoam cup
+........................ # each dot represents a cup
 ........................
 ```
 
@@ -23,8 +23,8 @@ There are 12 children in the class:
 - Eve, Fred, Ginny, Harriet,
 - Ileana, Joseph, Kincaid, and Larry.
 
-Each child gets 4 cups, two on each row. The children are assigned to
-cups in alphabetical order.
+Each child gets 4 cups, two on each row. Their teacher assigns cups to 
+the children alphabetically by their names.
 
 The following diagram represents Alice's plants:
 
@@ -34,12 +34,12 @@ VR......................
 RG......................
 ```
 
-So in the row nearest the window, she has a violet and a radish; in the
-row behind that, she has a radish and some grass.
+In the first row, nearest the windows, she has a violet and a radish.  In the
+second row she has a radish and some grass.
 
 Your program will be given the plants from left-to-right starting with
 the row nearest the windows. From this, it should be able to determine
-which plants belong to which students.
+which plants belong to each student.
 
 For example, if it's told that the garden looks like so:
 

data/problem-specifications/exercises/leap/canonical-data.json

@@ -1,6 +1,6 @@
 {
   "exercise": "leap",
-  "version": "1.0.0",
+  "version": "1.1.0",
   "cases": [
     {
       "description": "year not divisible by 4: common year",
@@ -11,7 +11,7 @@
     {
       "description": "year divisible by 4, not divisible by 100: leap year",
       "property": "leapYear",
-      "input": 2016,
+      "input": 2020,
       "expected": true
     },
     {

data/problem-specifications/exercises/markdown/canonical-data.json

@@ -1,6 +1,6 @@
 {
   "exercise": "markdown",
-  "version": "1.0.0",
+  "version": "1.1.0",
   "comments": [
     "Markdown is a shorthand for creating HTML from text strings."
   ],
@@ -51,7 +51,7 @@
       "description": "unordered lists",
       "property": "parse",
       "input": "* Item 1\n* Item 2",
-      "expected": "<ul><li><p>Item 1</p></li><li><p>Item 2</p></li></ul>"
+      "expected": "<ul><li>Item 1</li><li>Item 2</li></ul>"
     },
     {
       "description": "With a little bit of everything",

data/problem-specifications/exercises/nucleotide-count/canonical-data.json

@@ -1,6 +1,6 @@
 {
   "exercise": "nucleotide-count",
-  "version": "1.0.0",
+  "version": "1.1.0",
   "cases": [
     {
       "description": "count all nucleotides in a strand",
@@ -27,6 +27,17 @@
             "T": 0
           }
         },
+        {
+          "description": "can count one nucleotide in single-character input",
+          "property": "nucleotideCounts",
+          "strand": "G",
+          "expected": {
+            "A": 0,
+            "C": 0,
+            "G": 1,
+            "T": 0
+          }
+        },
         {
           "description": "strand with multiple nucleotides",
           "property": "nucleotideCounts",

data/problem-specifications/exercises/pangram/canonical-data.json

@@ -3,7 +3,7 @@
   "comments": [
     "A pangram is a sentence using every letter of the alphabet at least once."
   ],
-  "version": "1.1.0",
+  "version": "1.2.0",
   "cases": [
     {
       "description": "Check if the given string is an pangram",
@@ -17,6 +17,12 @@
           "input": "",
           "expected": false
         },
+        {
+          "description": "recognizes a perfect lower case pangram",
+          "property": "isPangram",
+          "input": "abcdefghijklmnopqrstuvwxyz",
+          "expected": true
+        },
         {
           "description": "pangram with only lower case",
           "property": "isPangram",

data/problem-specifications/exercises/queen-attack/canonical-data.json

@@ -1,6 +1,6 @@
 {
   "exercise": "queen-attack",
-  "version": "1.0.0",
+  "version": "2.0.0",
   "comments": [
     "Testing invalid positions will vary by language. The expected",
     "value of -1 is there to indicate some sort of failure should",
@@ -18,39 +18,54 @@
           "description": "queen with a valid position",
           "property": "create",
           "queen": {
-            "position": "(2,2)"
+            "position": {
+              "row": 2,
+              "column": 2
+            }
           },
           "expected": 0
         },
         {
-          "description": "queen must have positive rank",
+          "description": "queen must have positive row",
           "property": "create",
           "queen": {
-            "position": "(-2,2)"
+            "position": {
+              "row": -2,
+              "column": 2
+            }
           },
           "expected": -1
         },
         {
-          "description": "queen must have rank on board",
+          "description": "queen must have row on board",
           "property": "create",
           "queen": {
-            "position": "(8,4)"
+            "position": {
+              "row": 8,
+              "column": 4
+            }
           },
           "expected": -1
         },
         {
-          "description": "queen must have positive file",
+          "description": "queen must have positive column",
           "property": "create",
           "queen": {
-            "position": "(2,-2)"
+            "position": {
+              "row": 2,
+              "column": -2
+            }
           },
           "expected": -1
         },
         {
-          "description": "queen must have file on board",
+          "description": "queen must have column on board",
           "property": "create",
           "queen": {
-            "position": "(4,8)"
+            "position": {
+              "row": 4,
+              "column": 8
+            }
           },
           "expected": -1
         }
@@ -63,32 +78,50 @@
           "description": "can not attack",
           "property": "canAttack",
           "white_queen": {
-            "position": "(2,4)"
+            "position": {
+              "row": 2,
+              "column": 4
+            }
           },
           "black_queen": {
-            "position": "(6,6)"
+            "position": {
+              "row": 6,
+              "column": 6
+            }
           },
           "expected": false
         },
         {
-          "description": "can attack on same rank",
+          "description": "can attack on same row",
           "property": "canAttack",
           "white_queen": {
-            "position": "(2,4)"
+            "position": {
+              "row": 2,
+              "column": 4
+            }
           },
           "black_queen": {
-            "position": "(2,6)"
+            "position": {
+              "row": 2,
+              "column": 6
+            }
           },
           "expected": true
         },
         {
-          "description": "can attack on same file",
+          "description": "can attack on same column",
           "property": "canAttack",
           "white_queen": {
-            "position": "(4,5)"
+            "position": {
+              "row": 4,
+              "column": 5
+            }
           },
           "black_queen": {
-            "position": "(2,5)"
+            "position": {
+              "row": 2,
+              "column": 5
+            }
           },
           "expected": true
         },
@@ -96,10 +129,16 @@
           "description": "can attack on first diagonal",
           "property": "canAttack",
           "white_queen": {
-            "position": "(2,2)"
+            "position": {
+              "row": 2,
+              "column": 2
+            }
           },
           "black_queen": {
-            "position": "(0,4)"
+            "position": {
+              "row": 0,
+              "column": 4
+            }
           },
           "expected": true
         },
@@ -107,10 +146,16 @@
           "description": "can attack on second diagonal",
           "property": "canAttack",
           "white_queen": {
-            "position": "(2,2)"
+            "position": {
+              "row": 2,
+              "column": 2
+            }
           },
           "black_queen": {
-            "position": "(3,1)"
+            "position": {
+              "row": 3,
+              "column": 1
+            }
           },
           "expected": true
         },
@@ -118,10 +163,16 @@
           "description": "can attack on third diagonal",
           "property": "canAttack",
           "white_queen": {
-            "position": "(2,2)"
+            "position": {
+              "row": 2,
+              "column": 2
+            }
           },
           "black_queen": {
-            "position": "(1,1)"
+            "position": {
+              "row": 1,
+              "column": 1
+            }
           },
           "expected": true
         },
@@ -129,10 +180,16 @@
           "description": "can attack on fourth diagonal",
           "property": "canAttack",
           "white_queen": {
-            "position": "(2,2)"
+            "position": {
+              "row": 2,
+              "column": 2
+            }
           },
           "black_queen": {
-            "position": "(5,5)"
+            "position": {
+              "row": 5,
+              "column": 5
+            }
           },
           "expected": true
         }