trackler 2.1.0.18 → 2.1.0.19

data/common/exercises/poker/canonical-data.json

@@ -0,0 +1,317 @@
+{
+  "exercise": "poker",
+  "version": "1.0.0",
+  "cases": [
+    {
+      "description": "single hand always wins",
+      "property": "bestHands",
+      "input": [
+        "4S 5S 7H 8D JC"
+      ],
+      "expected": [
+        "4S 5S 7H 8D JC"
+      ]
+    },
+    {
+      "description": "highest card out of all hands wins",
+      "property": "bestHands",
+      "input": [
+        "4D 5S 6S 8D 3C",
+        "2S 4C 7S 9H 10H",
+        "3S 4S 5D 6H JH"
+      ],
+      "expected": [
+        "3S 4S 5D 6H JH"
+      ]
+    },
+    {
+      "description": "a tie has multiple winners",
+      "property": "bestHands",
+      "input": [
+        "4D 5S 6S 8D 3C",
+        "2S 4C 7S 9H 10H",
+        "3S 4S 5D 6H JH",
+        "3H 4H 5C 6C JD"
+      ],
+      "expected": [
+        "3S 4S 5D 6H JH",
+        "3H 4H 5C 6C JD"
+      ]
+    },
+    {
+      "description": "multiple hands with the same high cards, tie compares next highest ranked, down to last card",
+      "property": "bestHands",
+      "input": [
+        "3S 5H 6S 8D 7H",
+        "2S 5D 6D 8C 7S"
+      ],
+      "expected": [
+        "3S 5H 6S 8D 7H"
+      ]
+    },
+    {
+      "description": "one pair beats high card",
+      "property": "bestHands",
+      "input": [
+        "4S 5H 6C 8D KH",
+        "2S 4H 6S 4D JH"
+      ],
+      "expected": [
+        "2S 4H 6S 4D JH"
+      ]
+    },
+    {
+      "description": "highest pair wins",
+      "property": "bestHands",
+      "input": [
+        "4S 2H 6S 2D JH",
+        "2S 4H 6C 4D JD"
+      ],
+      "expected": [
+        "2S 4H 6C 4D JD"
+      ]
+    },
+    {
+      "description": "two pairs beats one pair",
+      "property": "bestHands",
+      "input": [
+        "2S 8H 6S 8D JH",
+        "4S 5H 4C 8C 5C"
+      ],
+      "expected": [
+        "4S 5H 4C 8C 5C"
+      ]
+    },
+    {
+      "description": "both hands have two pairs, highest ranked pair wins",
+      "property": "bestHands",
+      "input": [
+        "2S 8H 2D 8D 3H",
+        "4S 5H 4C 8S 5D"
+      ],
+      "expected": [
+        "2S 8H 2D 8D 3H"
+      ]
+    },
+    {
+      "description": "both hands have two pairs, with the same highest ranked pair, tie goes to low pair",
+      "property": "bestHands",
+      "input": [
+        "2S QS 2C QD JH",
+        "JD QH JS 8D QC"
+      ],
+      "expected": [
+        "JD QH JS 8D QC"
+      ]
+    },
+    {
+      "description": "both hands have two identically ranked pairs, tie goes to remaining card (kicker)",
+      "property": "bestHands",
+      "input": [
+        "JD QH JS 8D QC",
+        "JS QS JC 2D QD"
+      ],
+      "expected": [
+        "JD QH JS 8D QC"
+      ]
+    },
+    {
+      "description": "three of a kind beats two pair",
+      "property": "bestHands",
+      "input": [
+        "2S 8H 2H 8D JH",
+        "4S 5H 4C 8S 4H"
+      ],
+      "expected": [
+        "4S 5H 4C 8S 4H"
+      ]
+    },
+    {
+      "description": "both hands have three of a kind, tie goes to highest ranked triplet",
+      "property": "bestHands",
+      "input": [
+        "2S 2H 2C 8D JH",
+        "4S AH AS 8C AD"
+      ],
+      "expected": [
+        "4S AH AS 8C AD"
+      ]
+    },
+    {
+      "description": "with multiple decks, two players can have same three of a kind, ties go to highest remaining cards",
+      "property": "bestHands",
+      "input": [
+        "4S AH AS 7C AD",
+        "4S AH AS 8C AD"
+      ],
+      "expected": [
+        "4S AH AS 8C AD"
+      ]
+    },
+    {
+      "description": "a straight beats three of a kind",
+      "property": "bestHands",
+      "input": [
+        "4S 5H 4C 8D 4H",
+        "3S 4D 2S 6D 5C"
+      ],
+      "expected": [
+        "3S 4D 2S 6D 5C"
+      ]
+    },
+    {
+      "description": "aces can end a straight (10 J Q K A)",
+      "property": "bestHands",
+      "input": [
+        "4S 5H 4C 8D 4H",
+        "10D JH QS KD AC"
+      ],
+      "expected": [
+        "10D JH QS KD AC"
+      ]
+    },
+    {
+      "description": "aces can start a straight (A 2 3 4 5)",
+      "property": "bestHands",
+      "input": [
+        "4S 5H 4C 8D 4H",
+        "4D AH 3S 2D 5C"
+      ],
+      "expected": [
+        "4D AH 3S 2D 5C"
+      ]
+    },
+    {
+      "description": "both hands with a straight, tie goes to highest ranked card",
+      "property": "bestHands",
+      "input": [
+        "4S 6C 7S 8D 5H",
+        "5S 7H 8S 9D 6H"
+      ],
+      "expected": [
+        "5S 7H 8S 9D 6H"
+      ]
+    },
+    {
+      "description": "even though an ace is usually high, a 5-high straight is the lowest-scoring straight",
+      "property": "bestHands",
+      "input": [
+        "2H 3C 4D 5D 6H",
+        "4S AH 3S 2D 5H"
+      ],
+      "expected": [
+        "2H 3C 4D 5D 6H"
+      ]
+    },
+    {
+      "description": "flush beats a straight",
+      "property": "bestHands",
+      "input": [
+        "4C 6H 7D 8D 5H",
+        "2S 4S 5S 6S 7S"
+      ],
+      "expected": [
+        "2S 4S 5S 6S 7S"
+      ]
+    },
+    {
+      "description": "both hands have a flush, tie goes to high card, down to the last one if necessary",
+      "property": "bestHands",
+      "input": [
+        "4H 7H 8H 9H 6H",
+        "2S 4S 5S 6S 7S"
+      ],
+      "expected": [
+        "4H 7H 8H 9H 6H"
+      ]
+    },
+    {
+      "description": "full house beats a flush",
+      "property": "bestHands",
+      "input": [
+        "3H 6H 7H 8H 5H",
+        "4S 5H 4C 5D 4H"
+      ],
+      "expected": [
+        "4S 5H 4C 5D 4H"
+      ]
+    },
+    {
+      "description": "both hands have a full house, tie goes to highest-ranked triplet",
+      "property": "bestHands",
+      "input": [
+        "4H 4S 4D 9S 9D",
+        "5H 5S 5D 8S 8D"
+      ],
+      "expected": [
+        "5H 5S 5D 8S 8D"
+      ]
+    },
+    {
+      "description": "with multiple decks, both hands have a full house with the same triplet, tie goes to the pair",
+      "property": "bestHands",
+      "input": [
+        "5H 5S 5D 9S 9D",
+        "5H 5S 5D 8S 8D"
+      ],
+      "expected": [
+        "5H 5S 5D 9S 9D"
+      ]
+    },
+    {
+      "description": "four of a kind beats a full house",
+      "property": "bestHands",
+      "input": [
+        "4S 5H 4D 5D 4H",
+        "3S 3H 2S 3D 3C"
+      ],
+      "expected": [
+        "3S 3H 2S 3D 3C"
+      ]
+    },
+    {
+      "description": "both hands have four of a kind, tie goes to high quad",
+      "property": "bestHands",
+      "input": [
+        "2S 2H 2C 8D 2D",
+        "4S 5H 5S 5D 5C"
+      ],
+      "expected": [
+        "4S 5H 5S 5D 5C"
+      ]
+    },
+    {
+      "description": "with multiple decks, both hands with identical four of a kind, tie determined by kicker" ,
+      "property": "bestHands",
+      "input": [
+        "3S 3H 2S 3D 3C",
+        "3S 3H 4S 3D 3C"
+      ],
+      "expected": [
+        "3S 3H 4S 3D 3C"
+      ]
+    },
+    {
+      "description": "straight flush beats four of a kind",
+      "property": "bestHands",
+      "input": [
+        "4S 5H 5S 5D 5C",
+        "7S 8S 9S 6S 10S"
+      ],
+      "expected": [
+        "7S 8S 9S 6S 10S"
+      ]
+    },
+    {
+      "description": "both hands have straight flush, tie goes to highest-ranked card",
+      "property": "bestHands",
+      "input": [
+        "4H 6H 7H 8H 5H",
+        "5S 7S 8S 9S 6S"
+      ],
+      "expected": [
+        "5S 7S 8S 9S 6S"
+      ]
+    }
+  ]
+}

data/common/exercises/poker/description.md

@@ -1,3 +1,5 @@
+Pick the best hand(s) from a list of poker hands.
+
 Write an algorithm to pick the best poker hand(s) from a list.
 
 See [wikipedia](https://en.wikipedia.org/wiki/List_of_poker_hands) for an

data/common/exercises/pov/description.md

@@ -1,3 +1,5 @@
+Reparent a graph on a selected node.
+
 # Tree Reparenting
 
 This exercise is all about re-orientating a graph to see things from a different

data/common/exercises/prime-factors/description.md

@@ -1,3 +1,5 @@
+Compute the prime factors of a given natural number.
+
 A prime number is only evenly divisible by itself and 1.
 
 Note that 1 is not a prime number.

data/common/exercises/protein-translation/description.md

@@ -1,3 +1,5 @@
+Translate RNA sequences into proteins.
+
 Let's translate RNA sequences into proteins. [general ref](http://en.wikipedia.org/wiki/Translation_(biology))
 
 RNA can be broken into three nucleotide sequences called codons, and then translated to a polypeptide like so:

data/common/exercises/proverb/description.md

@@ -1,3 +1,5 @@
+For want of a horseshoe nail, a kingdom was lost, or so the saying goes. Output the full text of this proverbial rhyme.
+
 For want of a nail the shoe was lost.
 For want of a shoe the horse was lost.
 For want of a horse the rider was lost.

data/common/exercises/pythagorean-triplet/description.md

@@ -1,3 +1,5 @@
+There exists exactly one Pythagorean triplet for which a + b + c = 1000. Find the product a * b * c.
+
 A Pythagorean triplet is a set of three natural numbers, {a, b, c}, for
 which,
 

data/common/exercises/queen-attack/description.md

@@ -1,3 +1,5 @@
+Given the position of two queens on a chess board, indicate whether or not they are positioned so that they can attack each other.
+
 In the game of chess, a queen can attack pieces which are on the same
 row, column, or diagonal.
 

data/common/exercises/rail-fence-cipher/description.md

@@ -1,3 +1,5 @@
+Implement encoding and decoding for the rail fence cipher.
+
 The Rail Fence cipher is a form of transposition cipher that gets its name from
 the way in which it's encoded. It was already used by the ancient Greeks.
 

data/common/exercises/raindrops/description.md

@@ -1,3 +1,5 @@
+Convert a number to a string, the contents of which depend on the number's factors.
+
 - If the number has 3 as a factor, output 'Pling'.
 - If the number has 5 as a factor, output 'Plang'.
 - If the number has 7 as a factor, output 'Plong'.

data/common/exercises/react/description.md

@@ -1,3 +1,5 @@
+Implement a basic reactive system.
+
 Reactive programming is a programming paradigm that focuses on how values
 are computed in terms of each other to allow a change to one value to
 automatically propagate to other values, like in a spreadsheet.

data/common/exercises/rectangles/description.md

@@ -1,3 +1,5 @@
+Count the rectangles in an ASCII diagram.
+
 Create a program to count the rectangles in an ASCII diagram like the one below.
 
 ```

data/common/exercises/rna-transcription/description.md

@@ -1,3 +1,5 @@
+Given a DNA strand, return its RNA complement (per RNA transcription).
+
 Both DNA and RNA strands are a sequence of nucleotides.
 
 The four nucleotides found in DNA are adenine (**A**), cytosine (**C**),

data/common/exercises/robot-name/description.md

@@ -1,3 +1,5 @@
+Manage robot factory settings.
+
 When robots come off the factory floor, they have no name.
 
 The first time you boot them up, a random name is generated in the format

data/common/exercises/robot-simulator/description.md

@@ -1,3 +1,5 @@
+Write a robot simulator.
+
 A robot factory's test facility needs a program to verify robot movements.
 
 The robots have three possible movements:

data/common/exercises/roman-numerals/description.md

@@ -1,3 +1,5 @@
+Write a function to convert from normal numbers to Roman Numerals.
+
 The Romans were a clever bunch. They conquered most of Europe and ruled
 it for hundreds of years. They invented concrete and straight roads and
 even bikinis. One thing they never discovered though was the number

data/common/exercises/rotational-cipher/description.md

@@ -1,3 +1,5 @@
+Create an implementation of the rotational cipher, also sometimes called the Caesar cipher.
+
 # Rotational Cipher
 
 Create an implementation of the rotational cipher, also sometimes called the Caesar cipher.

data/common/exercises/run-length-encoding/description.md

@@ -1,3 +1,5 @@
+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.
 

data/common/exercises/saddle-points/description.md

@@ -1,3 +1,5 @@
+Detect saddle points in a matrix.
+
 So say you have a matrix like so:
 
 ```plain

data/common/exercises/say/description.md

@@ -1,3 +1,5 @@
+Given a number from 0 to 999,999,999,999, spell out that number in English.
+
 ## Step 1
 
 Handle the basic case of 0 through 99.

data/common/exercises/scale-generator/description.md

@@ -1,3 +1,5 @@
+Generate musical scales, given a starting note and a set of intervals.
+
 Given a tonic, or starting note, and a set of intervals, generate
 the musical scale starting with the tonic and following the
 specified interval pattern.

data/common/exercises/scrabble-score/description.md

@@ -1,3 +1,5 @@
+Given a word, compute the scrabble score for that word.
+
 ## Letter Values
 
 You'll need these:

data/common/exercises/secret-handshake/description.md

@@ -1,3 +1,5 @@
+Given a decimal number, convert it to the appropriate sequence of events for a secret handshake.
+
 > There are 10 types of people in the world: Those who understand
 > binary, and those who don't.
 

data/common/exercises/series/description.md

@@ -1,3 +1,5 @@
+Given a string of digits, output all the contiguous substrings of length `n` in that string.
+
 For example, the string "49142" has the following 3-digit series:
 
 - 491

data/common/exercises/sgf-parsing/description.md

@@ -1,3 +1,5 @@
+Parsing a Smart Game Format string.
+
 [SGF](https://en.wikipedia.org/wiki/Smart_Game_Format) is a standard format for
 storing board game files, in particular go.
 

data/common/exercises/sieve/description.md

@@ -1,3 +1,5 @@
+Use the Sieve of Eratosthenes to find all the primes from 2 up to a given number.
+
 The Sieve of Eratosthenes is a simple, ancient algorithm for finding all
 prime numbers up to any given limit. It does so by iteratively marking as
 composite (i.e. not prime) the multiples of each prime,

data/common/exercises/simple-cipher/description.md

@@ -1,3 +1,5 @@
+Implement a simple shift cipher like Caesar and a more secure substitution cipher.
+
 ## Step 1
 
 "If he had anything confidential to say, he wrote it in cipher, that is,

data/common/exercises/simple-linked-list/description.md

@@ -1,3 +1,5 @@
+Write a simple linked list implementation that uses Elements and a List.
+
 The linked list is a fundamental data structure in computer science,
 often used in the implementation of other data structures. They're
 pervasive in functional programming languages, such as Clojure, Erlang,

data/common/exercises/space-age/description.md

@@ -1,3 +1,5 @@
+Given an age in seconds, calculate how old someone is in terms of a given planet's solar years.
+
 Given an age in seconds, calculate how old someone would be on:
 
    - Earth: orbital period 365.25 Earth days, or 31557600 seconds

data/common/exercises/strain/description.md

@@ -1,3 +1,5 @@
+Implement the `keep` and `discard` operation on collections. Given a collection and a predicate on the collection's elements, `keep` returns a new collection containing those elements where the predicate is true, while `discard` returns a new collection containing those elements where the predicate is false.
+
 Write two functions that each take a function and a list.  One of them will
 return the list of items for which the passed in function is true, and the
 other will return the items for which it is false.

data/common/exercises/sublist/description.md

@@ -1,3 +1,5 @@
+Write a function to determine if a list is a sublist of another list.
+
 Write a function that given two lists determines if the first list is
 contained within the second list, if the second list is contained within
 the first list, if both lists are contained within each other or if none

data/common/exercises/sum-of-multiples/description.md

@@ -1,3 +1,5 @@
+Given a number, find the sum of all the 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.
 

data/common/exercises/transpose/description.md

@@ -1,3 +1,5 @@
+Take input text and output it transposed.
+
 Given an input text output it transposed.
 
 Roughly explained, the transpose of a matrix:

data/common/exercises/tree-building/description.md

@@ -1,3 +1,5 @@
+Refactor a tree building algorithm.
+
 Some web-forums have a tree layout, so posts are presented as a tree. However
 the posts are typically stored in a database as an unsorted set of records. Thus
 when presenting the posts to the user the tree structure has to be

data/common/exercises/triangle/description.md

@@ -1,3 +1,5 @@
+Determine if a triangle is equilateral, isosceles, or scalene.
+
 An _equilateral_ triangle has all three sides the same length.<br/>
 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

data/common/exercises/trinary/description.md

@@ -1,3 +1,5 @@
+Convert a trinary number, represented as a string (e.g. '102012'), to its decimal equivalent using first principles.
+
 The program should consider strings specifying an invalid trinary as the
 value 0.
 

data/common/exercises/twelve-days/description.md

@@ -1,3 +1,5 @@
+Output the lyrics to 'The Twelve Days of Christmas'.
+
 ```ruby
 On the first day of Christmas my true love gave to me, a Partridge in a Pear Tree.
 

data/common/exercises/two-bucket/description.md

@@ -1,3 +1,5 @@
+Given two buckets of different size, demonstrate how to measure an exact number of liters.
+
 Given two buckets of different size, demonstrate how to measure an exact number of liters by strategically transferring liters of fluid between the buckets.
 
 Since this mathematical problem is fairly subject to interpretation / individual approach, the tests have been written specifically to expect one overarching solution.

data/common/exercises/variable-length-quantity/description.md

@@ -1,3 +1,5 @@
+Implement variable length quantity encoding and decoding.
+
 The goal of this exercise is to implement [VLQ](https://en.wikipedia.org/wiki/Variable-length_quantity) encoding/decoding.
 
 In short, the goal of this encoding is to encode integer values in a way that would save bytes.

data/common/exercises/word-count/description.md

@@ -1,3 +1,5 @@
+Given a phrase, count the occurrences of each word in that phrase.
+
 For example for the input `"olly olly in come free"`
 
 ```plain

data/common/exercises/word-search/description.md

@@ -1,3 +1,5 @@
+Create a program to solve a word search puzzle.
+
 In word search puzzles you get a square of letters and have to find specific
 words in them.
 

data/common/exercises/wordy/description.md

@@ -1,3 +1,5 @@
+Parse and evaluate simple math word problems returning the answer as an integer.
+
 
 ## Iteration 1 — Addition
 

data/common/exercises/zebra-puzzle/description.md

@@ -1,3 +1,5 @@
+Solve the zebra puzzle.
+
 1. There are five houses.
 2. The Englishman lives in the red house.
 3. The Spaniard owns the dog.

data/common/exercises/zipper/description.md

@@ -1,3 +1,5 @@
+Creating a zipper for a binary tree.
+
 [Zippers](https://en.wikipedia.org/wiki/Zipper_%28data_structure%29) are
 a way purely functional of navigating within a data structure and
 manipulating it.  They essentially contain a data structure and a