trackler 2.2.1.47 → 2.2.1.48

data/tracks/gnu-apl/exercises/raindrops/README.md

@@ -0,0 +1,24 @@
+# Raindrops
+
+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'.
+- If the number does not have 3, 5, or 7 as a factor,
+  just pass the number's digits straight through.
+
+## Examples
+
+- 28's factors are 1, 2, 4, **7**, 14, 28.
+  - In raindrop-speak, this would be a simple "Plong".
+- 30's factors are 1, 2, **3**, **5**, 6, 10, 15, 30.
+  - In raindrop-speak, this would be a "PlingPlang".
+- 34 has four factors: 1, 2, 17, and 34.
+  - In raindrop-speak, this would be "34".
+## Source
+
+A variation on a famous interview question intended to weed out potential candidates. [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/gnu-apl/exercises/raindrops/raindrops-example.apl

@@ -0,0 +1,8 @@
+#!/usr/bin/env apl --script
+
+∇drops←convert integer;factors;sounds;multiple_of
+  factors←3 5 7
+  sounds←('Pling' 'Plang' 'Plong')
+  multiple_of←0=factors|integer
+  drops←∊(multiple_of,∧/0=multiple_of)/sounds,⊂⍕integer
+∇

data/tracks/gnu-apl/exercises/raindrops/raindrops.tc

@@ -0,0 +1,60 @@
+log←'./raindrops.tc.log'
+⍎ ')COPY ',(⎕FIO 30),'/../../test.apl'
+
+test∆copy_relative 'raindrops.apl'
+test∆clear_log log
+
+⍝ ∇convert
+⍝ Given an integer, returns a string representation of that integer's "raindrop sound", based on its prime factors.
+
+⍝ the sound for 1 is '1'
+  1⎕CR convert 1
+'1'
+
+⍝ the sound for multiples of 3 is 'Pling'
+  convert 3
+Pling
+  convert 6
+Pling
+
+⍝ the sound for multiples of 5 is 'Plang'
+  convert 5
+Plang
+  convert 10
+Plang
+
+⍝ the sound for multiples of 7 is 'Plong'
+  convert 7
+Plong
+  convert 14
+Plong
+
+⍝ the sound for numbers that aren't multiples of 3, 5, or 7 is the stringified number
+  1⎕CR convert 8
+'8'
+  1⎕CR convert 52
+'52'
+
+⍝ the sound for numbers that have multiple raindrop factors is the combination of all the sounds
+  convert 15 ⍝ 3×5
+PlingPlang
+  convert 21 ⍝ 3×7
+PlingPlong
+  convert 35 ⍝ 5×7
+PlangPlong
+  1⎕CR convert 105 ⍝ 3×5×7
+'PlingPlangPlong'
+
+⍝ the sound for squares of a raindrop factor is only the single sound
+  convert 9 ⍝ 3×3
+Pling
+  convert 25 ⍝ 5×5
+Plang
+  convert 49 ⍝ 7×7
+Plong
+  convert 27 ⍝ 3*3
+Pling
+  convert 3125 ⍝ 5*5
+Plang
+
+test∆show_log log

data/tracks/gnu-apl/exercises/rna-transcription/README.md

@@ -0,0 +1,25 @@
+# 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`
+## 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/gnu-apl/exercises/rna-transcription/rna-transcription-example.apl

@@ -0,0 +1,7 @@
+#!/usr/bin/env apl --script
+
+∇rna←to_rna dna;dna_bases;rna_bases
+  dna_bases←'CGTA'
+  rna_bases←'GCAU'
+  '1÷0' ⎕EA 'rna←rna_bases[dna_bases⍳dna]' ⍝ throw a domain error if not found
+∇

data/tracks/gnu-apl/exercises/rna-transcription/rna-transcription.tc

@@ -0,0 +1,41 @@
+log←'./rna-transcription.tc.log'
+⍎ ')COPY ',(⎕FIO 30),'/../../test.apl'
+
+test∆copy_relative 'rna-transcription.apl'
+test∆clear_log log
+
+⍝ ∇to_rna
+
+⍝ RNA complement of cytosine is guanine
+  1⎕CR to_rna 'C'
+'G'
+
+⍝ RNA complement of guanine is cytosine
+  to_rna 'G'
+C
+
+⍝ RNA complement of thymine is adenine
+  to_rna 'T'
+A
+
+⍝ RNA complement of adenine is uracil
+  to_rna 'A'
+U
+
+⍝ RNA complement of entire string
+  1⎕CR to_rna 'ACGTGGTCTTAA'
+'UGCACCAGAAUU'
+
+⍝ invalid input (RNA instead of DNA) throws domain error
+  1⎕CR test∆try 'to_rna "U"'
+1 'DOMAIN ERROR'
+
+⍝ completely invalid DNA input throws domain error
+  1⎕CR test∆try 'to_rna "XXX"'
+1 'DOMAIN ERROR'
+
+⍝ partially invalid DNA input throws domain error
+  1⎕CR test∆try 'to_rna "ACGTXXXCTTAA"'
+1 'DOMAIN ERROR'
+
+test∆show_log log

data/tracks/gnu-apl/test.apl

@@ -18,6 +18,19 @@
   test¯warn test¯read_unicode filename
 ∇
 
+⍝ Evaluate APL code (as string).
+⍝ Returns 2-element vector:
+⍝ [1] Boolean (1 if error, 0 if not).
+⍝ [2] Error message if error; original result if not.
+∇z←test∆try apl_string;response;is_error;result
+  response←⎕EC apl_string
+  is_error←0=1⊃response
+  result←3⊃response
+  →(~is_error)/return
+  result←result[1;]
+  return: z←is_error result
+∇
+
 ⍝ private
 
 ⍝ Return current directory as a string.

data/tracks/haskell/config.json

@@ -77,6 +77,15 @@
       "topics": [
       ]
     },
+    {
+      "uuid": "cd5ce9ad-b627-46e3-b6d8-872baf476bf1",
+      "slug": "rotational-cipher",
+      "core": false,
+      "unlocked_by": null,
+      "difficulty": 1,
+      "topics": [
+      ]
+    },
     {
       "uuid": "85d77b8e-9b87-4d02-9fba-81f843bd66f1",
       "slug": "rna-transcription",

data/tracks/haskell/exercises/rotational-cipher/README.md

@@ -0,0 +1,91 @@
+# Rotational Cipher
+
+Create an implementation of the rotational cipher, also sometimes called the Caesar cipher.
+
+The Caesar cipher is a simple shift cipher that relies on
+transposing all the letters in the alphabet using an integer key
+between `0` and `26`. Using a key of `0` or `26` will always yield
+the same output due to modular arithmetic. The letter is shifted
+for as many values as the value of the key.
+
+The general notation for rotational ciphers is `ROT + <key>`.
+The most commonly used rotational cipher is `ROT13`.
+
+A `ROT13` on the Latin alphabet would be as follows:
+
+```text
+Plain:  abcdefghijklmnopqrstuvwxyz
+Cipher: nopqrstuvwxyzabcdefghijklm
+```
+
+It is stronger than the Atbash cipher because it has 27 possible keys, and 25 usable keys.
+
+Ciphertext is written out in the same formatting as the input including spaces and punctuation.
+
+## Examples
+
+- ROT5  `omg` gives `trl`
+- ROT0  `c` gives `c`
+- ROT26 `Cool` gives `Cool`
+- ROT13 `The quick brown fox jumps over the lazy dog.` gives `Gur dhvpx oebja sbk whzcf bire gur ynml qbt.`
+- ROT13 `Gur dhvpx oebja sbk whzcf bire gur ynml qbt.` gives `The quick brown fox jumps over the lazy dog.`
+
+
+## Getting Started
+
+For installation and learning resources, refer to the
+[exercism help page](http://exercism.io/languages/haskell).
+
+## Running the tests
+
+To run the test suite, execute the following command:
+
+```bash
+stack test
+```
+
+#### If you get an error message like this...
+
+```
+No .cabal file found in directory
+```
+
+You are probably running an old stack version and need
+to upgrade it.
+
+#### Otherwise, if you get an error message like this...
+
+```
+No compiler found, expected minor version match with...
+Try running "stack setup" to install the correct GHC...
+```
+
+Just do as it says and it will download and install
+the correct compiler version:
+
+```bash
+stack setup
+```
+
+## Running *GHCi*
+
+If you want to play with your solution in GHCi, just run the command:
+
+```bash
+stack ghci
+```
+
+## Feedback, Issues, Pull Requests
+
+The [exercism/haskell](https://github.com/exercism/haskell) repository on
+GitHub is the home for all of the Haskell 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
+
+Wikipedia [https://en.wikipedia.org/wiki/Caesar_cipher](https://en.wikipedia.org/wiki/Caesar_cipher)
+
+## Submitting Incomplete Solutions
+It's possible to submit an incomplete solution so you can see how others have completed the exercise.

data/tracks/haskell/exercises/rotational-cipher/examples/success-standard/package.yaml

@@ -0,0 +1,16 @@
+name: rotational-cipher
+
+dependencies:
+  - base
+
+library:
+  exposed-modules: RotationalCipher
+  source-dirs: src
+
+tests:
+  test:
+    main: Tests.hs
+    source-dirs: test
+    dependencies:
+      - rotational-cipher
+      - hspec

data/tracks/haskell/exercises/rotational-cipher/examples/success-standard/src/RotationalCipher.hs

@@ -0,0 +1,9 @@
+module RotationalCipher (rotate) where
+
+import Data.List (elemIndex)
+
+rotate :: Int -> String -> String
+rotate r = map (f r ['a'..'z'] . f r ['A'..'Z'])
+  where f x abc e = case elemIndex e abc of
+                      Nothing -> e
+                      Just a  -> abc!!mod (a+x) 26

data/tracks/haskell/exercises/rotational-cipher/package.yaml

@@ -0,0 +1,20 @@
+name: rotational-cipher
+version: 1.1.0.1
+
+dependencies:
+  - base
+
+library:
+  exposed-modules: RotationalCipher
+  source-dirs: src
+  dependencies:
+  # - foo       # List here the packages you
+  # - bar       # want to use in your solution.
+
+tests:
+  test:
+    main: Tests.hs
+    source-dirs: test
+    dependencies:
+      - rotational-cipher
+      - hspec

data/tracks/haskell/exercises/rotational-cipher/src/RotationalCipher.hs

@@ -0,0 +1,4 @@
+module RotationalCipher (rotate) where
+
+rotate :: Int -> String -> String
+rotate = error "You need to implement this function."

data/tracks/haskell/exercises/rotational-cipher/stack.yaml

@@ -0,0 +1 @@
+resolver: lts-8.21

data/tracks/haskell/exercises/rotational-cipher/test/Tests.hs

@@ -0,0 +1,77 @@
+{-# LANGUAGE RecordWildCards #-}
+
+import Data.Foldable     (for_)
+import Test.Hspec        (Spec, describe, it, shouldBe)
+import Test.Hspec.Runner (configFastFail, defaultConfig, hspecWith)
+
+import RotationalCipher (rotate)
+
+main :: IO ()
+main = hspecWith defaultConfig {configFastFail = True} specs
+
+specs :: Spec
+specs = describe "rotate" $ for_ cases test
+  where
+
+    test Case{..} = it description assertion
+      where
+        assertion = rotate number phrase `shouldBe` expected
+
+data Case = Case { description :: String
+                 , number      :: Int
+                 , phrase      :: String
+                 , expected    :: String
+                 }
+
+cases :: [Case]
+cases = [ Case { description = "rotate a by 0, same output as input"
+               , number      = 0
+               , phrase      = "a"
+               , expected    = "a"
+               }
+        , Case { description = "rotate a by 1"
+               , number      = 1
+               , phrase      = "a"
+               , expected    = "b"
+               }
+        , Case { description = "rotate a by 26, same output as input"
+               , number      = 26
+               , phrase      = "a"
+               , expected    = "a"
+               }
+        , Case { description = "rotate m by 13"
+               , number      = 13
+               , phrase      = "m"
+               , expected    = "z"
+               }
+        , Case { description = "rotate n by 13 with wrap around alphabet"
+               , number      = 13
+               , phrase      = "n"
+               , expected    = "a"
+               }
+        , Case { description = "rotate capital letters"
+               , number      = 5
+               , phrase      = "OMG"
+               , expected    = "TRL"
+               }
+        , Case { description = "rotate spaces"
+               , number      = 5
+               , phrase      = "O M G"
+               , expected    = "T R L"
+               }
+        , Case { description = "rotate numbers"
+               , number      = 4
+               , phrase      = "Testing 1 2 3 testing"
+               , expected    = "Xiwxmrk 1 2 3 xiwxmrk"
+               }
+        , Case { description = "rotate punctuation"
+               , number      = 21
+               , phrase      = "Let's eat, Grandma!"
+               , expected    = "Gzo'n zvo, Bmviyhv!"
+               }
+        , Case { description = "rotate all letters"
+               , number      = 13
+               , phrase      = "The quick brown fox jumps over the lazy dog."
+               , expected    = "Gur dhvpx oebja sbk whzcf bire gur ynml qbt."
+               }
+        ]

data/tracks/java/config.json

@@ -214,7 +214,12 @@
       "core": true,
       "difficulty": 4,
       "slug": "triangle",
-      "topics": null,
+      "topics": [
+        "booleans",
+        "classes",
+        "exception_handling",
+        "mathematics"
+      ],
       "unlocked_by": null,
       "uuid": "ec268d8e-997b-4553-8c67-8bdfa1ecb888"
     },
@@ -654,18 +659,6 @@
       "unlocked_by": "word-count",
       "uuid": "76d28d97-75d3-47eb-bb77-3d347b76f1b6"
     },
-    {
-      "core": true,
-      "difficulty": 6,
-      "slug": "linked-list",
-      "topics": [
-        "algorithms",
-        "lists",
-        "generics"
-      ],
-      "unlocked_by": null,
-      "uuid": "7ba5084d-3b75-4406-a0d7-87c26387f9c0"
-    },
     {
       "core": false,
       "difficulty": 6,
@@ -752,7 +745,11 @@
       "core": true,
       "difficulty": 6,
       "slug": "bank-account",
-      "topics": null,
+      "topics": [
+        "concurrency",
+        "exception_handling",
+        "integers"
+      ],
       "unlocked_by": null,
       "uuid": "a242efc5-159d-492b-861d-12a1459fb334"
     },
@@ -764,6 +761,18 @@
       "unlocked_by": "scrabble-score",
       "uuid": "4b3f7771-c642-4278-a3d9-2fb958f26361"
     },
+    {
+      "core": true,
+      "difficulty": 6,
+      "slug": "linked-list",
+      "topics": [
+        "algorithms",
+        "lists",
+        "generics"
+      ],
+      "unlocked_by": null,
+      "uuid": "7ba5084d-3b75-4406-a0d7-87c26387f9c0"
+    },
     {
       "core": false,
       "difficulty": 6,