trackler 2.2.1.4 → 2.2.1.5

data/tracks/coq/exercises/rna-transcription/README.md

@@ -0,0 +1,49 @@
+# Rna Transcription
+
+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**),
+guanine (**G**) and thymine (**T**).
+
+The four nucleotides found in RNA are adenine (**A**), cytosine (**C**),
+guanine (**G**) and uracil (**U**).
+
+Given a DNA strand, its transcribed RNA strand is formed by replacing
+each nucleotide with its complement:
+
+* `G` -> `C`
+* `C` -> `G`
+* `T` -> `A`
+* `A` -> `U`
+
+## Getting Started
+
+For installation and learning resources, refer to the
+[exercism help page](http://exercism.io/languages/coq).
+
+## Checking the solution (testing everything)
+
+To see if your solution works you just need to compile every file.
+
+```bash
+coqc *.v
+```
+
+There is no additional testing step needed as we can offload all testing to the type checker!
+
+## Feedback, Issues, Pull Requests
+
+The [exercism/coq](https://github.com/exercism/coq) repository on
+GitHub is the home for all of the Coq exercises.
+
+If you have feedback about an exercise, or want to help implementing a new
+one, head over there and create an issue.  We'll do our best to help you!
+
+## Source
+
+Rosalind [http://rosalind.info/problems/rna](http://rosalind.info/problems/rna)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/coq/exercises/tautology/README.md

@@ -0,0 +1,33 @@
+# Tautology
+
+Let us start by proving something we already know is true.
+
+## Getting Started
+
+For installation and learning resources, refer to the
+[exercism help page](http://exercism.io/languages/coq).
+
+## Checking the solution (testing everything)
+
+To see if your solution works you just need to compile every file.
+
+```bash
+coqc *.v
+```
+
+There is no additional testing step needed as we can offload all testing to the type checker!
+
+## Feedback, Issues, Pull Requests
+
+The [exercism/coq](https://github.com/exercism/coq) repository on
+GitHub is the home for all of the Coq exercises.
+
+If you have feedback about an exercise, or want to help implementing a new
+one, head over there and create an issue.  We'll do our best to help you!
+
+## Source
+
+Coq classics
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/cpp/config/exercise_readme.go.tmpl

@@ -0,0 +1,16 @@
+# {{ .Spec.Name }}
+
+{{ .Spec.Description -}}
+{{- with .Hints }}
+{{ . }}
+{{ end }}
+{{- with .TrackInsert }}
+{{ . }}
+{{ end }}
+{{- with .Spec.Credits -}}
+## Source
+
+{{ . }}
+{{ end }}
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/cpp/config.json

@@ -1,49 +1,59 @@
 {
-  "slug": "cpp",
   "language": "C++",
-  "repository": "https://github.com/exercism/cpp",
   "active": true,
-  "deprecated": [
-
-  ],
   "foregone": [
     "point-mutations"
   ],
   "exercises": [
     {
-      "difficulty": 1,
+      "uuid": "3eeadff6-82b6-43be-8834-d9ef258e454d",
       "slug": "hello-world",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 1,
       "topics": [
         "strings"
       ]
     },
     {
-      "difficulty": 1,
+      "uuid": "76a840c7-24f1-455d-b62e-da42b13f8dd5",
       "slug": "leap",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 1,
       "topics": [
         "logic",
         "control-flow (conditionals)"
       ]
     },
     {
-      "difficulty": 2,
+      "uuid": "4dbe1bb3-0419-4749-8c2a-ec91539a8640",
       "slug": "gigasecond",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 2,
       "topics": [
         "dates",
         "interfaces"
       ]
     },
     {
-      "difficulty": 3,
+      "uuid": "a9716747-8cc6-4529-b5d2-dc24bd8641a8",
       "slug": "hamming",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 3,
       "topics": [
         "strings",
         "control-flow (loops)"
       ]
     },
     {
-      "difficulty": 5,
+      "uuid": "d80210b8-45e8-4e5c-8b07-9e87c33c5959",
       "slug": "bob",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 5,
       "topics": [
         "strings",
         "control-flow (conditionals)",
@@ -51,8 +61,11 @@
       ]
     },
     {
-      "difficulty": 5,
+      "uuid": "a34d1c83-fb96-4b7a-aeca-fdb17cf91a75",
       "slug": "anagram",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 5,
       "topics": [
         "strings",
         "filtering",
@@ -60,8 +73,11 @@
       ]
     },
     {
-      "difficulty": 3,
+      "uuid": "0dd45f6a-c6cd-4549-a56b-7babe0a71add",
       "slug": "etl",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 3,
       "topics": [
         "maps",
         "arrays",
@@ -69,8 +85,11 @@
       ]
     },
     {
-      "difficulty": 5,
+      "uuid": "d531e2b1-28bc-4025-b3a7-119d314b5a80",
       "slug": "word-count",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 5,
       "topics": [
         "strings",
         "arrays",
@@ -79,23 +98,32 @@
       ]
     },
     {
-      "difficulty": 3,
+      "uuid": "46cb230c-8ce9-431d-9dea-a195a3abd117",
       "slug": "difference-of-squares",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 3,
       "topics": [
         "control-flow (loops)"
       ]
     },
     {
-      "difficulty": 3,
+      "uuid": "949f5680-a7a5-4c1e-ac19-bb4bae658d5c",
       "slug": "nucleotide-count",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 3,
       "topics": [
         "strings",
         "parsing"
       ]
     },
     {
-      "difficulty": 7,
+      "uuid": "6805ef10-ab91-4d97-af80-9d326255497d",
       "slug": "food-chain",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 7,
       "topics": [
         "strings",
         "control-flow (loops)",
@@ -103,108 +131,150 @@
       ]
     },
     {
-      "difficulty": 5,
+      "uuid": "76491cb2-25a8-4495-ba3e-85aace65319e",
       "slug": "phone-number",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 5,
       "topics": [
         "strings",
         "parsing"
       ]
     },
     {
-      "difficulty": 3,
+      "uuid": "a15922b1-467f-4db4-a023-0bb262333551",
       "slug": "grade-school",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 3,
       "topics": [
         "arrays",
         "parsing"
       ]
     },
     {
-      "difficulty": 5,
+      "uuid": "67c3cb10-b893-428a-82d0-79602aef2775",
       "slug": "robot-name",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 5,
       "topics": [
         "strings",
         "randomness"
       ]
     },
     {
-      "difficulty": 3,
+      "uuid": "a190ad11-db1c-4624-a477-e1d0c91d8b4f",
       "slug": "sum-of-multiples",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 3,
       "topics": [
         "mathematics"
       ]
     },
     {
-      "difficulty": 1,
+      "uuid": "1763159f-3358-42d0-9ad0-2eb90baca600",
       "slug": "space-age",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 1,
       "topics": [
         "functions"
       ]
     },
     {
-      "difficulty": 5,
+      "uuid": "e597f659-f31a-4a1b-a697-d91ede672642",
       "slug": "meetup",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 5,
       "topics": [
         "interfaces",
         "functions"
       ]
     },
     {
-      "difficulty": 3,
+      "uuid": "54a0753e-c161-4dfd-a7b0-02dc7a923d82",
       "slug": "scrabble-score",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 3,
       "topics": [
         "strings",
         "maps"
       ]
     },
     {
-      "difficulty": 3,
+      "uuid": "d23a2c36-7182-4fd0-84db-34b27fabda2e",
       "slug": "triangle",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 3,
       "topics": [
         "mathematics",
         "control-flow (conditionals)"
       ]
     },
     {
-      "difficulty": 2,
+      "uuid": "c3dc3764-72b9-4926-9747-61db90553e2b",
       "slug": "grains",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 2,
       "topics": [
         "bitwise operations"
       ]
     },
     {
-      "difficulty": 2,
+      "uuid": "9155f4ea-3566-4a57-a2c5-76535d931ccc",
       "slug": "raindrops",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 2,
       "topics": [
         "strings"
       ]
     },
     {
-      "difficulty": 7,
+      "uuid": "52dce31c-f8ab-44db-accd-573f4b82dcf9",
       "slug": "roman-numerals",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 7,
       "topics": [
         "strings",
         "mathematics"
       ]
     },
     {
-      "difficulty": 3,
+      "uuid": "1cc6a583-3def-4d15-a45a-4b1fe16826bf",
       "slug": "binary",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 3,
       "topics": [
         "strings",
         "mathematics"
       ]
     },
     {
-      "difficulty": 5,
+      "uuid": "ba755932-b301-41cc-b7f2-5e6d2e130325",
       "slug": "prime-factors",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 5,
       "topics": [
         "mathematics",
         "control-flow (loops)"
       ]
     },
     {
-      "difficulty": 7,
+      "uuid": "177ecdf4-f249-4193-b9e1-8f1c6480bfad",
       "slug": "crypto-square",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 7,
       "topics": [
         "strings",
         "filtering",
@@ -212,23 +282,32 @@
       ]
     },
     {
-      "difficulty": 3,
+      "uuid": "c8246de0-29b1-4f92-8b00-b766e395ad66",
       "slug": "trinary",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 3,
       "topics": [
         "strings",
         "mathematics"
       ]
     },
     {
-      "difficulty": 3,
+      "uuid": "2fbd008c-5007-4403-ae71-f4d1f5ccaf8f",
       "slug": "rna-transcription",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 3,
       "topics": [
         "strings"
       ]
     },
     {
-      "difficulty": 10,
+      "uuid": "090b2615-cd05-442b-be74-9f11bd5a83a5",
       "slug": "say",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 10,
       "topics": [
         "strings",
         "logic",
@@ -236,16 +315,22 @@
       ]
     },
     {
-      "difficulty": 5,
+      "uuid": "7ea05dd1-2c3c-499e-8608-dc76d30c5457",
       "slug": "sieve",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 5,
       "topics": [
         "mathematics",
         "control-flow (loops)"
       ]
     },
     {
-      "difficulty": 5,
+      "uuid": "0ab70460-3a2f-4c37-bb78-716ba720fe34",
       "slug": "series",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 5,
       "topics": [
         "strings",
         "arrays",
@@ -253,47 +338,65 @@
       ]
     },
     {
-      "difficulty": 5,
+      "uuid": "fab94f5a-d4da-4a18-a70a-b27c80b14851",
       "slug": "clock",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 5,
       "topics": [
         "classes",
         "time"
       ]
     },
     {
-      "difficulty": 7,
+      "uuid": "a384c32c-d8db-4877-816b-44de7c3ed324",
       "slug": "beer-song",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 7,
       "topics": [
         "strings",
         "text formatting"
       ]
     },
     {
-      "difficulty": 5,
+      "uuid": "675b0a5c-0587-4dc5-8004-1f82769a2ddd",
       "slug": "nth-prime",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 5,
       "topics": [
         "mathematics"
       ]
     },
     {
-      "difficulty": 3,
+      "uuid": "c2e8e3fc-a39c-434b-87dd-9524636aa804",
       "slug": "hexadecimal",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 3,
       "topics": [
         "strings",
         "mathematics"
       ]
     },
     {
-      "difficulty": 5,
+      "uuid": "0d5e4c9e-4351-41b1-9154-ee900ad0e60e",
       "slug": "queen-attack",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 5,
       "topics": [
         "logic",
         "control-flow (loops)"
       ]
     },
     {
-      "difficulty": 3,
+      "uuid": "80ae6a8e-8464-4f3a-afed-14d424757413",
       "slug": "allergies",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 3,
       "topics": [
         "bitwise operations",
         "filtering"

data/tracks/cpp/exercises/allergies/README.md

@@ -0,0 +1,69 @@
+# Allergies
+
+Given a person's allergy score, determine whether or not they're allergic to a given item, and their full list of allergies.
+
+An allergy test produces a single numeric score which contains the
+information about all the allergies the person has (that they were
+tested for).
+
+The list of items (and their value) that were tested are:
+
+* eggs (1)
+* peanuts (2)
+* shellfish (4)
+* strawberries (8)
+* tomatoes (16)
+* chocolate (32)
+* pollen (64)
+* cats (128)
+
+So if Tom is allergic to peanuts and chocolate, he gets a score of 34.
+
+Now, given just that score of 34, your program should be able to say:
+
+- Whether Tom is allergic to any one of those allergens listed above.
+- All the allergens Tom is allergic to.
+
+Note: a given score may include allergens **not** listed above (i.e.
+allergens that score 256, 512, 1024, etc.).  Your program should
+ignore those components of the score.  For example, if the allergy
+score is 257, your program should only report the eggs (1) allergy.
+
+
+## Getting Started
+
+Make sure you have read [the C++ page](http://exercism.io/languages/cpp) on
+exercism.io.  This covers the basic information on setting up the development
+environment expected by the exercises.
+
+## Passing the Tests
+
+Get the first test compiling, linking and passing by following the [three
+rules of test-driven development](http://butunclebob.com/ArticleS.UncleBob.TheThreeRulesOfTdd).
+Create just enough structure by declaring namespaces, functions, classes,
+etc., to satisfy any compiler errors and get the test to fail.  Then write
+just enough code to get the test to pass.  Once you've done that,
+uncomment the next test by moving the following line past the next test.
+
+```C++
+#if defined(EXERCISM_RUN_ALL_TESTS)
+```
+
+This may result in compile errors as new constructs may be invoked that
+you haven't yet declared or defined.  Again, fix the compile errors minimally
+to get a failing test, then change the code minimally to pass the test,
+refactor your implementation for readability and expressiveness and then
+go on to the next test.
+
+Try to use standard C++11 facilities in preference to writing your own
+low-level algorithms or facilities by hand.  [CppReference](http://en.cppreference.com/)
+is a wiki reference to the C++ language and standard library.  If you
+are new to C++, but have programmed in C, beware of
+[C traps and pitfalls](http://www.slideshare.net/LegalizeAdulthood/c-traps-and-pitfalls-for-c-programmers).
+
+## Source
+
+Jumpstart Lab Warm-up [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.

data/tracks/cpp/exercises/anagram/README.md

@@ -0,0 +1,45 @@
+# Anagram
+
+Given a word and a list of possible anagrams, select the correct sublist.
+
+Given `"listen"` and a list of candidates like `"enlists" "google"
+"inlets" "banana"` the program should return a list containing
+`"inlets"`.
+
+## Getting Started
+
+Make sure you have read [the C++ page](http://exercism.io/languages/cpp) on
+exercism.io.  This covers the basic information on setting up the development
+environment expected by the exercises.
+
+## Passing the Tests
+
+Get the first test compiling, linking and passing by following the [three
+rules of test-driven development](http://butunclebob.com/ArticleS.UncleBob.TheThreeRulesOfTdd).
+Create just enough structure by declaring namespaces, functions, classes,
+etc., to satisfy any compiler errors and get the test to fail.  Then write
+just enough code to get the test to pass.  Once you've done that,
+uncomment the next test by moving the following line past the next test.
+
+```C++
+#if defined(EXERCISM_RUN_ALL_TESTS)
+```
+
+This may result in compile errors as new constructs may be invoked that
+you haven't yet declared or defined.  Again, fix the compile errors minimally
+to get a failing test, then change the code minimally to pass the test,
+refactor your implementation for readability and expressiveness and then
+go on to the next test.
+
+Try to use standard C++11 facilities in preference to writing your own
+low-level algorithms or facilities by hand.  [CppReference](http://en.cppreference.com/)
+is a wiki reference to the C++ language and standard library.  If you
+are new to C++, but have programmed in C, beware of
+[C traps and pitfalls](http://www.slideshare.net/LegalizeAdulthood/c-traps-and-pitfalls-for-c-programmers).
+
+## Source
+
+Inspired by the Extreme Startup game [https://github.com/rchatley/extreme_startup](https://github.com/rchatley/extreme_startup)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.