trackler 2.2.1.122 → 2.2.1.123

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: b7204c3a7c334b406bdccc8cf1fd1e72df1b2a82
-  data.tar.gz: db207af8aeefcdcef612be1b4fee783992d9b749
+  metadata.gz: c897a3dbf6364ea2d268b80851cdd4333bf32af9
+  data.tar.gz: f0314259e05072db6b7c79d853b925d303ad723e
 SHA512:
-  metadata.gz: e706a7070bccfdb422adc9e95b6c0c6b5da63def0e7155a545484a4a2d1fd6a11e11e3f63d83641124aa66428510e82ecbb4676c6385d8e30ed4b58959f23aee
-  data.tar.gz: 56da76a889cf060963274bb6b6bd1d95aac844e316c075993bac1a46b06ed6f43bbfc7f353019dbc959e44d055a1930ede9c64a20a1f74cb6ae8bee6dbcb4203
+  metadata.gz: aaefda1096a1d4c541c5614cfce2b6ebfb1f2fb56cc68f4d4636b743ef9e18d13a239bda4d27775d0b303912eaaff3f811d3cf3ddc61effbce8fc966c78e87ff
+  data.tar.gz: 600577c09afa131b3eea31807e42f2f68ffa5612ceb366d69c99c56ee40dd9cd210f690772bb8a045661de29a08faf1c318dffea5003817383f38184dfeb798f

data/lib/trackler/version.rb

@@ -1,3 +1,3 @@
 module Trackler
-  VERSION = "2.2.1.122"
+  VERSION = "2.2.1.123"
 end

data/tracks/clojure/config.json

@@ -589,6 +589,14 @@
       "topics": null,
       "unlocked_by": null,
       "uuid": "c8ba6ce5-9a7e-4c1c-8044-bb18a0d6ad39"
+    },
+    {
+      "core": false,
+      "difficulty": 1,
+      "slug": "poker",
+      "topics": null,
+      "unlocked_by": null,
+      "uuid": "7df7ff1c-74ab-4f4e-aaf0-257b6e1cbc18"
     }
   ],
   "foregone": [],

data/tracks/clojure/exercises/poker/README.md

@@ -0,0 +1,11 @@
+Pick the best hand(s) from a list of poker hands.
+
+See [wikipedia](https://en.wikipedia.org/wiki/List_of_poker_hands) for an
+overview of poker hands.
+
+## Source
+
+[Inspired by the training course from Udacity.](https://www.udacity.com/course/viewer#!/c-cs212/)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/clojure/exercises/poker/project.clj

@@ -0,0 +1,4 @@
+(defproject poker "0.1.0-SNAPSHOT"
+  :description "poker exercise."
+  :url "https://github.com/exercism/clojure/tree/master/exercises/poker"
+  :dependencies [[org.clojure/clojure "1.9.0"]])

data/tracks/clojure/exercises/poker/src/example.clj

@@ -0,0 +1,42 @@
+(ns poker
+  (:require [clojure.string :as cs]))
+
+(defn rank-hand [hand]
+  (let [h (cs/split (cs/replace hand #"10" "T") #" ")
+        initial-ranks (map #(.indexOf (seq "..23456789TJQKA") (first %)) h)
+        score-frec (reverse (sort-by vec (map (comp vec reverse)
+                                              (frequencies initial-ranks))))
+        rank-counts (mapv first score-frec)
+        normalized-ranks (if (= (mapv second score-frec) [14,5,4,3,2]) [5,4,3,2,1]
+                             (mapv second score-frec))
+        straight? (and (= 5 (count rank-counts))
+                       (= 4 (- (apply max rank-counts) (apply min rank-counts))))
+        flush? (= 1 (count (distinct (map last h))))]
+    (cond (= 5 rank-counts)         [9 normalized-ranks]
+          (and straight? flush?)    [8 normalized-ranks]
+          (= rank-counts [4 1])     [7 normalized-ranks]
+          (= rank-counts [3 2])     [6 normalized-ranks]
+          flush?                    [5 normalized-ranks]
+          straight?                 [4 normalized-ranks]
+          (= rank-counts [3 1 1])   [3 normalized-ranks]
+          (= rank-counts [2 2 1])   [2 normalized-ranks]
+          (= rank-counts [2 1 1 1]) [1 normalized-ranks]
+          :else                     [0 normalized-ranks])))
+
+(defn greater-than [xs ys]
+  (or (> (first xs) (first ys))
+      (->> (map compare (second xs) (second ys))
+           (take-while (partial not= -1))
+           (some (partial = 1)))))
+
+(defn best-hands [hands]
+  (-> (fn [[max-rank record hands]]
+        (let [[x & xs] hands
+              rank     (rank-hand x)]
+           (cond
+             (or (empty? record) (greater-than rank max-rank)) [rank [x] xs]
+             (= rank max-rank) [max-rank (conj record x) xs]
+             :else [max-rank record xs])))
+      (iterate  [[0 []] [] hands])
+      (nth (count hands))
+      (second)))

data/tracks/clojure/exercises/poker/src/poker.clj

@@ -0,0 +1,3 @@
+(ns poker)
+
+(defn best-hands [hands])

data/tracks/clojure/exercises/poker/test/poker_test.clj

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

data/tracks/swift/.travis.yml

@@ -16,10 +16,5 @@ matrix:
       env: JOB=Linux41x
       sudo: required
       services: docker
-    - script: 
-        - ./xswift-test-spm
-      env: JOB=SPM
-      os: osx
-      osx_image: xcode9.3beta 
 
 

data/tracks/swift/circle.yml

@@ -1,9 +1,9 @@
 version: 2
 
 jobs:
-  build920:
+  build930:
     macos:
-      xcode: "9.2.0"
+      xcode: "9.3.0"
     steps:
       - checkout
       - run: sudo gem install danger
@@ -15,6 +15,12 @@ jobs:
           name: Danger Systems
           when: on_success
           command: danger || true # Dont fail build on non zero exit codes
+  build920:
+    macos:
+      xcode: "9.2.0"
+    steps:
+      - checkout
+      - run: ./xswift-test-spm
   build910:
     macos:
       xcode: "9.1.0"
@@ -34,3 +40,4 @@ workflows:
       - build901
       - build910
       - build920
+      - build930

data/tracks/typescript/config.json

@@ -344,6 +344,21 @@
       "unlocked_by": "bob",
       "uuid": "50447e18-cfe8-43fb-a791-e8a82483bef6"
     },
+    {
+      "core": false,
+      "difficulty": 4,
+      "slug": "proverb",
+      "topics": [
+        "arrays",
+        "control_flow_conditionals",
+        "control_flow_loops",
+        "optional_values",
+        "strings",
+        "text_formatting"
+      ],
+      "unlocked_by": "bob",
+      "uuid": "b18876a7-f281-46e5-94b9-f805bb0d1fec"
+    },
     {
       "core": false,
       "difficulty": 5,
@@ -825,6 +840,20 @@
       "unlocked_by": "pangram",
       "uuid": "b646dc26-59c1-436e-883a-20290de7a526"
     },
+    {
+      "core": false,
+      "difficulty": 7,
+      "slug": "kindergarten-garden",
+      "topics": [
+        "Control-flow (conditionals)",
+        "Control-flow (loops)",
+        "Strings",
+        "Arrays",
+        "Text formatting"
+      ],
+      "unlocked_by": "wordy",
+      "uuid": "b1ab1795-3f8e-43f6-86b4-88be4967e934"
+    },
     {
       "core": false,
       "difficulty": 5,

data/tracks/typescript/exercises/kindergarten-garden/README.md

@@ -0,0 +1,97 @@
+# Kindergarten Garden
+
+Given a diagram, determine which plants each child in the kindergarten class is
+responsible for.
+
+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, 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 cup
+........................
+```
+
+There are 12 children in the class:
+
+- Alice, Bob, Charlie, David,
+- Eve, Fred, Ginny, Harriet,
+- Ileana, Joseph, Kincaid, and Larry.
+
+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:
+
+```text
+[window][window][window]
+VR......................
+RG......................
+```
+
+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 each student.
+
+For example, if it's told that the garden looks like so:
+
+```text
+[window][window][window]
+VRCGVVRVCGGCCGVRGCVCGCGV
+VRCCCGCRRGVCGCRVVCVGCGCV
+```
+
+Then if asked for Alice's plants, it should provide:
+
+- Violets, radishes, violets, radishes
+
+While asking for Bob's plants would yield:
+
+- Clover, grass, clover, clover
+
+## 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
+```
+
+In the test suites all tests but the first have been skipped.
+
+Once you get a test passing, you can enable the next one by
+changing `xit` to `it`.
+
+
+## Source
+
+Random musings during airplane trip. [http://jumpstartlab.com](http://jumpstartlab.com)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.
+<Paste>

data/tracks/typescript/exercises/kindergarten-garden/kindergarten-garden.example.ts

@@ -0,0 +1,64 @@
+const defaultChildren = [
+  'Alice',
+  'Bob',
+  'Charlie',
+  'David',
+  'Eve',
+  'Fred',
+  'Ginny',
+  'Harriet',
+  'Ileana',
+  'Joseph',
+  'Kincaid',
+  'Larry',
+]
+
+interface Plants {
+  [code: string]: string
+}
+
+const plants: Plants = {
+  G: "grass",
+  V: "violets",
+  R: "radishes",
+  C: "clover"
+}
+
+interface Pots {
+  upper: string[]
+  lower: string[]
+}
+
+const converToPots = (pots: string[][]): Pots => {
+  return {
+    upper: pots[0],
+    lower: pots[1]
+  }
+}
+
+const getPlants = (pots: Pots, index: number): string[] => {
+  const plants = []
+  const position = 2 * index
+  plants.push(pots.upper[position])
+  plants.push(pots.upper[position + 1])
+  plants.push(pots.lower[position])
+  plants.push(pots.lower[position + 1])
+  return plants
+}
+
+const parse = (diagram: string): string[][] => {
+  return diagram.split('\n').map((row) => [...row].map((sign) => plants[sign]))
+}
+
+export default class Garden {
+  [student: string]: string[]
+
+  constructor(diagrams: string, students?: string[]) {
+    this.students = students || defaultChildren
+    this.students.sort()
+
+    this.students.forEach((student, index) => {
+      this[student.toLocaleLowerCase()] = getPlants(converToPots(parse(diagrams)), index)
+    })
+  }
+}