trackler 2.2.1.4 → 2.2.1.5

data/tracks/idris/exercises/hamming/README.md

@@ -0,0 +1,42 @@
+# Hamming
+
+Calculate the Hamming difference between two DNA strands.
+
+A mutation is simply a mistake that occurs during the creation or
+copying of a nucleic acid, in particular DNA. Because nucleic acids are
+vital to cellular functions, mutations tend to cause a ripple effect
+throughout the cell. Although mutations are technically mistakes, a very
+rare mutation may equip the cell with a beneficial attribute. In fact,
+the macro effects of evolution are attributable by the accumulated
+result of beneficial microscopic mutations over many generations.
+
+The simplest and most common type of nucleic acid mutation is a point
+mutation, which replaces one base with another at a single nucleotide.
+
+By counting the number of differences between two homologous DNA strands
+taken from different genomes with a common ancestor, we get a measure of
+the minimum number of point mutations that could have occurred on the
+evolutionary path between the two strands.
+
+This is called the 'Hamming distance'.
+
+It is found by comparing two DNA strands and counting how many of the
+nucleotides are different from their equivalent in the other string.
+
+    GAGCCTACTAACGGGAT
+    CATCGTAATGACGGCCT
+    ^ ^ ^  ^ ^    ^^
+
+The Hamming distance between these two DNA strands is 7.
+
+# Implementation notes
+
+The Hamming distance is only defined for sequences of equal length. This means
+that based on the definition, each language could deal with getting sequences
+of equal length differently.
+## Source
+
+The Calculating Point Mutations problem at Rosalind [http://rosalind.info/problems/hamm/](http://rosalind.info/problems/hamm/)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/idris/exercises/hello-world/README.md

@@ -0,0 +1,21 @@
+# Hello World
+
+The classical introductory exercise. Just say "Hello, World!".
+
+["Hello, World!"](http://en.wikipedia.org/wiki/%22Hello,_world!%22_program) is
+the traditional first program for beginning programming in a new language
+or environment.
+
+The objectives are simple:
+
+- Write a function that returns the string "Hello, World!".
+- Run the test suite and make sure that it succeeds.
+- Submit your solution and check it at the website.
+
+If everything goes well, you will be ready to fetch your first real exercise.
+## Source
+
+This is an exercise to introduce users to using Exercism [http://en.wikipedia.org/wiki/%22Hello,_world!%22_program](http://en.wikipedia.org/wiki/%22Hello,_world!%22_program)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/idris/exercises/leap/README.md

@@ -0,0 +1,33 @@
+# Leap
+
+Given a year, report if it is a leap year.
+
+The tricky thing here is that a leap year in the Gregorian calendar occurs:
+
+```plain
+on every year that is evenly divisible by 4
+  except every year that is evenly divisible by 100
+    unless the year is also evenly divisible by 400
+```
+
+For example, 1997 is not a leap year, but 1996 is.  1900 is not a leap
+year, but 2000 is.
+
+If your language provides a method in the standard library that does
+this look-up, pretend it doesn't exist and implement it yourself.
+
+## Notes
+
+Though our exercise adopts some very simple rules, there is more to
+learn!
+
+For a delightful, four minute explanation of the whole leap year
+phenomenon, go watch [this youtube video][video].
+
+[video]: http://www.youtube.com/watch?v=xX96xng7sAE
+## Source
+
+JavaRanch Cattle Drive, exercise 3 [http://www.javaranch.com/leap.jsp](http://www.javaranch.com/leap.jsp)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/java/config/maintainers.json

@@ -0,0 +1,45 @@
+{
+  "maintainers": [
+    {
+      "github_username": "sit",
+      "show_on_website": false,
+      "alumnus": false,
+      "name": null,
+      "bio": null,
+      "link_text": null,
+      "link_url": null,
+      "avatar_url": null
+    },
+    {
+      "github_username": "stkent",
+      "show_on_website": false,
+      "alumnus": false,
+      "name": null,
+      "bio": null,
+      "link_text": null,
+      "link_url": null,
+      "avatar_url": null
+    },
+    {
+      "github_username": "Smarticles101",
+      "show_on_website": false,
+      "alumnus": false,
+      "name": null,
+      "bio": null,
+      "link_text": null,
+      "link_url": null,
+      "avatar_url": null
+    },
+    {
+      "github_username": "FridaTveit",
+      "show_on_website": false,
+      "alumnus": false,
+      "name": null,
+      "bio": null,
+      "link_text": null,
+      "link_url": null,
+      "avatar_url": null
+    }
+  ],
+  "docs_url": "https://github.com/exercism/docs/blob/master/maintaining-a-track/maintainer-configuration.md"
+}

data/tracks/java/exercises/hello-world/TUTORIAL.md

@@ -33,7 +33,7 @@ in order to solve the current problem.
 
 Before proceeding any further, make sure you have completed the required setup
 steps described by the links below:
-* [Installing Java](http://exercism.io/languages/java/installing);
+* [Installing Java and Gradle](http://exercism.io/languages/java/installation);
 * [Running the Tests (in Java)](http://exercism.io/languages/java/tests).
 
 ## Step 1: Run the tests against the starter solution

data/tracks/javascript/config/maintainers.json

@@ -0,0 +1,85 @@
+{
+  "maintainers": [
+    {
+      "github_username": "ireddick",
+      "show_on_website": false,
+      "alumnus": false,
+      "name": null,
+      "bio": null,
+      "link_text": null,
+      "link_url": null,
+      "avatar_url": null
+    },
+    {
+      "github_username": "rchavarria",
+      "show_on_website": false,
+      "alumnus": false,
+      "name": null,
+      "bio": null,
+      "link_text": null,
+      "link_url": null,
+      "avatar_url": null
+    },
+    {
+      "github_username": "joelwallis",
+      "show_on_website": false,
+      "alumnus": false,
+      "name": null,
+      "bio": null,
+      "link_text": null,
+      "link_url": null,
+      "avatar_url": null
+    },
+    {
+      "github_username": "drueck",
+      "show_on_website": false,
+      "alumnus": false,
+      "name": null,
+      "bio": null,
+      "link_text": null,
+      "link_url": null,
+      "avatar_url": null
+    },
+    {
+      "github_username": "tejasbubane",
+      "show_on_website": false,
+      "alumnus": false,
+      "name": null,
+      "bio": null,
+      "link_text": null,
+      "link_url": null,
+      "avatar_url": null
+    },
+    {
+      "github_username": "matthewmorgan",
+      "show_on_website": false,
+      "alumnus": false,
+      "name": null,
+      "bio": null,
+      "link_text": null,
+      "link_url": null,
+      "avatar_url": null
+    },
+    {
+      "github_username": "mixolidia",
+      "show_on_website": false,
+      "alumnus": false,
+      "name": null,
+      "bio": null,
+      "link_text": null,
+      "link_url": null,
+      "avatar_url": null
+    },
+    {
+      "github_username": "ZacharyRSmith",
+      "show_on_website": false,
+      "alumnus": false,
+      "name": null,
+      "bio": null,
+      "link_text": null,
+      "link_url": null,
+      "avatar_url": null
+    }
+  ],
+  "docs_url": "https://github.com/exercism/docs/blob/master/maintaining-a-track/maintainer-configuration.md"
+}

data/tracks/julia/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/julia/config.json

@@ -1,18 +1,22 @@
 {
-  "slug": "julia",
   "language": "Julia",
-  "repository": "https://github.com/exercism/xjulia",
   "active": false,
   "exercises": [
     {
+      "uuid": "a668410d-41aa-4710-a68f-54521da6486d",
       "slug": "hello-world",
+      "core": false,
+      "unlocked_by": null,
       "difficulty": 1,
       "topics": [
         "strings"
       ]
     },
     {
+      "uuid": "878e9897-c4b6-40ff-9034-8f2aedf07a91",
       "slug": "hamming",
+      "core": false,
+      "unlocked_by": null,
       "difficulty": 1,
       "topics": [
         "generators",
@@ -21,21 +25,30 @@
       ]
     },
     {
+      "uuid": "c64e03cc-1952-4b2d-9a53-25c43187a4e6",
       "slug": "gigasecond",
+      "core": false,
+      "unlocked_by": null,
       "difficulty": 1,
       "topics": [
         "dates"
       ]
     },
     {
+      "uuid": "16550822-4751-4bb3-9e15-80361006e2d6",
       "slug": "difference-of-squares",
+      "core": false,
+      "unlocked_by": null,
       "difficulty": 1,
       "topics": [
         "generators"
       ]
     },
     {
+      "uuid": "bf709fe6-d269-467a-a3da-5bbdaf674f91",
       "slug": "pascals-triangle",
+      "core": false,
+      "unlocked_by": null,
       "difficulty": 1,
       "topics": [
         "control-flow (conditionals)",
@@ -45,7 +58,10 @@
       ]
     },
     {
+      "uuid": "54c24809-c6e7-419b-8ec3-6d8d128ca546",
       "slug": "nucleotide-count",
+      "core": false,
+      "unlocked_by": null,
       "difficulty": 1,
       "topics": [
         "chars",
@@ -54,7 +70,10 @@
       ]
     },
     {
+      "uuid": "07875495-146f-44a3-b13a-e8e74a37b87d",
       "slug": "word-count",
+      "core": false,
+      "unlocked_by": null,
       "difficulty": 1,
       "topics": [
         "control-flow (loops)",
@@ -63,7 +82,10 @@
       ]
     },
     {
+      "uuid": "0d5f865c-b704-445c-ac31-df34168f54aa",
       "slug": "rna-transcription",
+      "core": false,
+      "unlocked_by": null,
       "difficulty": 1,
       "topics": [
         "exception handling",
@@ -73,7 +95,10 @@
       ]
     },
     {
+      "uuid": "8740c914-f008-4b6b-8e7d-7470e78e6a8e",
       "slug": "leap",
+      "core": false,
+      "unlocked_by": null,
       "difficulty": 1,
       "topics": [
         "control-flow (conditionals)",
@@ -82,7 +107,10 @@
       ]
     },
     {
+      "uuid": "7a083573-2c68-47cc-8bc8-c0e483cf0e50",
       "slug": "raindrops",
+      "core": false,
+      "unlocked_by": null,
       "difficulty": 1,
       "topics": [
         "control-flow (loops)",
@@ -91,7 +119,10 @@
       ]
     },
     {
+      "uuid": "5feec698-0bf8-4308-9f72-2cecaab5e75e",
       "slug": "scrabble-score",
+      "core": false,
+      "unlocked_by": null,
       "difficulty": 1,
       "topics": [
         "control-flow (loops)",
@@ -101,7 +132,10 @@
       ]
     },
     {
+      "uuid": "cc08d672-9c58-4e7a-bfb7-344cbad811f7",
       "slug": "luhn",
+      "core": false,
+      "unlocked_by": null,
       "difficulty": 1,
       "topics": [
         "strings",
@@ -110,7 +144,10 @@
       ]
     },
     {
+      "uuid": "a4638670-941d-4213-8407-d9ebba70bd42",
       "slug": "atbash-cipher",
+      "core": false,
+      "unlocked_by": null,
       "difficulty": 1,
       "topics": [
         "strings",
@@ -119,7 +156,10 @@
       ]
     },
     {
+      "uuid": "58c41643-971c-4199-a10f-7dc21093e5e3",
       "slug": "roman-numerals",
+      "core": false,
+      "unlocked_by": null,
       "difficulty": 1,
       "topics": [
         "control-flow (loops)",
@@ -128,7 +168,10 @@
       ]
     },
     {
+      "uuid": "19f9e7c4-f2a5-4636-b7b2-4e0a15977e01",
       "slug": "isogram",
+      "core": false,
+      "unlocked_by": null,
       "difficulty": 1,
       "topics": [
         "control-flow (loops)",
@@ -138,7 +181,10 @@
       ]
     },
     {
+      "uuid": "d2cb1621-2a2e-4791-a6b6-fdbca74a5583",
       "slug": "anagram",
+      "core": false,
+      "unlocked_by": null,
       "difficulty": 2,
       "topics": [
         "control-flow (loops)",
@@ -149,7 +195,10 @@
       ]
     },
     {
+      "uuid": "4bc9a4f8-fc4d-4e6b-a93c-07069bbc5bc9",
       "slug": "pangram",
+      "core": false,
+      "unlocked_by": null,
       "difficulty": 1,
       "topics": [
         "arrays",
@@ -158,7 +207,10 @@
       ]
     },
     {
+      "uuid": "bccc00fa-811c-4bf9-8e55-07a0d0affb08",
       "slug": "etl",
+      "core": false,
+      "unlocked_by": null,
       "difficulty": 2,
       "topics": [
         "arrays",
@@ -167,7 +219,10 @@
       ]
     },
     {
+      "uuid": "9474a13b-09c1-4e4d-90e3-1a14fde5eb62",
       "slug": "bob",
+      "core": false,
+      "unlocked_by": null,
       "difficulty": 2,
       "topics": [
         "strings",
@@ -176,7 +231,10 @@
       ]
     },
     {
+      "uuid": "5e3b376a-06ab-442f-8d18-710db7778db6",
       "slug": "sieve",
+      "core": false,
+      "unlocked_by": null,
       "difficulty": 2,
       "topics": [
         "control-flow (loops)",
@@ -187,7 +245,10 @@
       ]
     },
     {
+      "uuid": "c09ed7ec-fa7c-4f6a-994f-3d3eb7f22df4",
       "slug": "trinary",
+      "core": false,
+      "unlocked_by": null,
       "difficulty": 2,
       "topics": [
         "arrays",
@@ -197,7 +258,10 @@
       ]
     },
     {
+      "uuid": "e5a6d640-cd76-4453-8247-fd34ffed4fe5",
       "slug": "transpose",
+      "core": false,
+      "unlocked_by": null,
       "difficulty": 2,
       "topics": [
         "control-flow (loops)",
@@ -207,7 +271,10 @@
       ]
     },
     {
+      "uuid": "d2c85375-c0e7-4e04-88f1-08736e5afa04",
       "slug": "secret-handshake",
+      "core": false,
+      "unlocked_by": null,
       "difficulty": 2,
       "topics": [
         "arrays",
@@ -216,7 +283,10 @@
       ]
     },
     {
+      "uuid": "7cb2d96a-4707-4cec-9ead-313fcb5fbb94",
       "slug": "robot-name",
+      "core": false,
+      "unlocked_by": null,
       "difficulty": 2,
       "topics": [
         "structs",
@@ -225,7 +295,10 @@
       ]
     },
     {
+      "uuid": "eca7e62c-7bbf-436c-8011-2920cb2ab1c1",
       "slug": "complex-numbers",
+      "core": false,
+      "unlocked_by": null,
       "difficulty": 2,
       "topics": [
         "structs",
@@ -236,7 +309,10 @@
       ]
     },
     {
+      "uuid": "79ea05f1-3f27-4b92-bc47-0cebcd8d5a6f",
       "slug": "rotational-cipher",
+      "core": false,
+      "unlocked_by": null,
       "difficulty": 2,
       "topics": [
         "string literals",
@@ -245,7 +321,10 @@
       ]
     },
     {
+      "uuid": "b47377f7-84af-4a10-83ef-c2444a4f8940",
       "slug": "custom-set",
+      "core": false,
+      "unlocked_by": null,
       "difficulty": 5,
       "topics": [
         "types",
@@ -257,9 +336,6 @@
         "iterators"
       ]
     }
-  ],
-  "deprecated": [
-
   ],
   "foregone": [
 

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

@@ -0,0 +1,13 @@
+# 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"`.
+## 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.

data/tracks/julia/exercises/atbash-cipher/README.md

@@ -0,0 +1,34 @@
+# Atbash Cipher
+
+Create an implementation of the atbash cipher, an ancient encryption system created in the Middle East.
+
+The Atbash cipher is a simple substitution cipher that relies on
+transposing all the letters in the alphabet such that the resulting
+alphabet is backwards. The first letter is replaced with the last
+letter, the second with the second-last, and so on.
+
+An Atbash cipher for the Latin alphabet would be as follows:
+
+```plain
+Plain:  abcdefghijklmnopqrstuvwxyz
+Cipher: zyxwvutsrqponmlkjihgfedcba
+```
+
+It is a very weak cipher because it only has one possible key, and it is
+a simple monoalphabetic substitution cipher. However, this may not have
+been an issue in the cipher's time.
+
+Ciphertext is written out in groups of fixed length, the traditional group size
+being 5 letters, and punctuation is excluded. This is to make it harder to guess
+things based on word boundaries.
+
+## Examples
+- Encoding `test` gives `gvhg`
+- Decoding `gvhg` gives `test`
+- Decoding `gsvjf rxpyi ldmul cqfnk hlevi gsvoz abwlt` gives `thequickbrownfoxjumpsoverthelazydog`
+## Source
+
+Wikipedia [http://en.wikipedia.org/wiki/Atbash](http://en.wikipedia.org/wiki/Atbash)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/julia/exercises/bob/README.md

@@ -0,0 +1,18 @@
+# Bob
+
+Bob is a lackadaisical teenager. In conversation, his responses are very limited.
+
+Bob answers 'Sure.' if you ask him a question.
+
+He answers 'Whoa, chill out!' if you yell at him.
+
+He says 'Fine. Be that way!' if you address him without actually saying
+anything.
+
+He answers 'Whatever.' to anything else.
+## Source
+
+Inspired by the 'Deaf Grandma' exercise in Chris Pine's Learn to Program tutorial. [http://pine.fm/LearnToProgram/?Chapter=06](http://pine.fm/LearnToProgram/?Chapter=06)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/julia/exercises/complex-numbers/README.md

@@ -0,0 +1,24 @@
+# Complex Numbers
+
+A complex number is a number in the form `a + b * i` where `a` and `b` are real and `i` satisfies `i^2 = -1`.
+
+Assume the programming language you are using does not have an implementation of complex numbers.
+
+The Julia Base implementation of complex numbers can be found here: https://github.com/JuliaLang/julia/blob/master/base/complex.jl.
+
+---
+
+You can work on the bonus exercises by changing `@test_skip` to `@test`.
+
+## Bonus A
+Implement the exponential function on complex numbers `exp(::ComplexNumber)`.
+
+## Bonus B
+Implement `jm` analogous to `im` so that `1 + 1jm == ComplexNumber(1, 1)`.
+
+## Source
+
+Wikipedia [https://en.wikipedia.org/wiki/Complex_number](https://en.wikipedia.org/wiki/Complex_number)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/julia/exercises/custom-set/README.md

@@ -0,0 +1,16 @@
+# Custom Set
+
+Create a custom set type.
+
+Sometimes it is necessary to define a custom data structure of some
+type, like a set. In this exercise you will define your own set. How it
+works internally doesn't matter, as long as it behaves like a set of
+unique elements.
+
+The tests require a constructor that takes an array. The internals of your custom set implementation can use other data structures but you may have to implement an outer constructor that takes exactly one array for the tests to pass.
+
+Certain methods have a unicode operator equivalent. E.g. `intersect(CustomSet([1, 2, 3, 4]), CustomSet([]))` is equivalent to `CustomSet([1, 2, 3, 4]) ∩ CustomSet([])`.
+
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/julia/exercises/difference-of-squares/README.md

@@ -0,0 +1,19 @@
+# Difference Of Squares
+
+Find the difference between the square of the sum and the sum of the squares of the first N natural numbers.
+
+The square of the sum of the first ten natural numbers is
+(1 + 2 + ... + 10)² = 55² = 3025.
+
+The sum of the squares of the first ten natural numbers is
+1² + 2² + ... + 10² = 385.
+
+Hence the difference between the square of the sum of the first
+ten natural numbers and the sum of the squares of the first ten
+natural numbers is 3025 - 385 = 2640.
+## Source
+
+Problem 6 at Project Euler [http://projecteuler.net/problem=6](http://projecteuler.net/problem=6)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.