trackler 2.2.1.13 → 2.2.1.14

data/tracks/kotlin/exercises/binary/README.md

@@ -28,7 +28,7 @@ Binary is similar, but uses powers of 2 rather than powers of 10.
 
 So: `101 => 1*2^2 + 0*2^1 + 1*2^0 => 1*4 + 0*2 + 1*1 => 4 + 1 => 5 base 10`.
 
-
+
 
 ## Source
 

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

@@ -11,7 +11,7 @@ anything.
 
 He answers 'Whatever.' to anything else.
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/bracket-push/README.md

@@ -3,7 +3,7 @@
 Given a string containing brackets `[]`, braces `{}` and parentheses `()`,
 verify that all the pairs are matched and nested correctly.
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/change/README.md

@@ -16,7 +16,7 @@ that the sum of the coins' value would equal the correct amount of change.
 - Can you ask for negative change?
 - Can you ask for a change value smaller than the smallest coin value?
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/clock/README.md

@@ -6,7 +6,7 @@ You should be able to add and subtract minutes to it.
 
 Two clocks that represent the same time should be equal to each other.
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/collatz-conjecture/README.md

@@ -26,7 +26,7 @@ Starting with n = 12, the steps would be as follows:
 Resulting in 9 steps. So for input n = 12, the return value would be 9.
 
 
-
+
 
 ## Source
 

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

@@ -4,7 +4,7 @@ A complex number is a number in the form `a + b * i` where `a` and `b` are real
 
 Assume the programming language you are using does not have an implementation of complex numbers.
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/diamond/README.md

@@ -52,7 +52,7 @@ E·······E
 ····A····
 ```
 
-
+
 
 ## Source
 

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

@@ -12,7 +12,7 @@ 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
 

data/tracks/kotlin/exercises/etl/README.md

@@ -44,7 +44,7 @@ variety of languages, each with its own unique scoring table. For
 example, an "E" is scored at 2 in the Māori-language version of the
 game while being scored at 4 in the Hawaiian-language version.
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/flatten-array/README.md

@@ -11,7 +11,7 @@ input: [1,[2,3,null,4],[null],5]
 output: [1,2,3,4,5]
 
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/gigasecond/README.md

@@ -4,7 +4,7 @@ Calculate the moment when someone has lived for 10^9 seconds.
 
 A gigasecond is 10^9 (1,000,000,000) seconds.
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/grade-school/README.md

@@ -35,7 +35,7 @@ are some additional things you could try:
 Then please share your thoughts in a comment on the submission. Did this
 experiment make the code better? Worse? Did you learn anything from it?
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/grains/README.md

@@ -27,7 +27,7 @@ are some additional things you could try:
 Then please share your thoughts in a comment on the submission. Did this
 experiment make the code better? Worse? Did you learn anything from it?
 
-
+
 
 ## Source
 

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

@@ -35,7 +35,7 @@ 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
 

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

@@ -14,7 +14,7 @@ The objectives are simple:
 
 If everything goes well, you will be ready to fetch your first real exercise.
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/hexadecimal/README.md

@@ -7,7 +7,7 @@ teal: 008080, navy: 000080).
 
 The program should handle invalid hexadecimal strings.
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/isogram/README.md

@@ -12,7 +12,7 @@ Examples of isograms:
 
 The word *isograms*, however, is not an isogram, because the s repeats.
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/largest-series-product/README.md

@@ -13,7 +13,7 @@ in the input; the digits need not be *numerically consecutive*.
 For the input `'73167176531330624919225119674426574742355349194934'`,
 the largest product for a series of 6 digits is 23520.
 
-
+
 
 ## Source
 

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

@@ -26,7 +26,7 @@ phenomenon, go watch [this youtube video][video].
 
 [video]: http://www.youtube.com/watch?v=xX96xng7sAE
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/linked-list/README.md

@@ -27,7 +27,7 @@ empty list.
 
 If you want to know more about linked lists, check [Wikipedia](https://en.wikipedia.org/wiki/Linked_list).
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/list-ops/README.md

@@ -13,7 +13,7 @@ The tests for this exercise require you to use extensions, a mechanism for addin
 The `customFoldLeft` and `customFoldRight` methods are "fold" functions, which is a concept well-known in the functional programming world, but less so in the object-oriented one. If you'd like more background information, check out this [fold](https://en.wikipedia.org/wiki/Fold_(higher-order_function)) page.
 
 
-
+
 
 
 ## Submitting Incomplete Solutions

data/tracks/kotlin/exercises/luhn/README.md

@@ -64,7 +64,7 @@ Sum the digits
 
 57 is not evenly divisible by 10, so this number is not valid.
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/minesweeper/README.md

@@ -26,7 +26,7 @@ into this:
     | 111 |
     +-----+
 
-
+
 
 
 ## Submitting Incomplete Solutions

data/tracks/kotlin/exercises/nth-prime/README.md

@@ -8,7 +8,7 @@ the 6th prime is 13.
 If your language provides methods in the standard library to deal with prime
 numbers, pretend they don't exist and implement them yourself.
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/nucleotide-count/README.md

@@ -26,7 +26,7 @@ DNA contains four types of them: adenine (`A`), cytosine (`C`), guanine
 RNA contains a slightly different set of nucleotides, but we don't care
 about that for now.
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/pangram/README.md

@@ -8,7 +8,7 @@ The best known English pangram is:
 The alphabet used consists of ASCII letters `a` to `z`, inclusive, and is case
 insensitive. Input will not contain non-ASCII symbols.
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/pascals-triangle/README.md

@@ -14,7 +14,7 @@ the right and left of the current position in the previous row.
 # ... etc
 ```
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/perfect-numbers/README.md

@@ -17,7 +17,7 @@ The Greek mathematician [Nicomachus](https://en.wikipedia.org/wiki/Nicomachus) d
   
 Implement a way to determine whether a given number is **perfect**. Depending on your language track, you may also need to implement a way to determine whether a given number is **abundant** or **deficient**.
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/phone-number/README.md

@@ -27,7 +27,7 @@ should all produce the output
 
 **Note:** As this exercise only deals with telephone numbers used in NANP-countries, only 1 is considered a valid country code.
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/pig-latin/README.md

@@ -17,7 +17,7 @@ variants too.
 
 See <http://en.wikipedia.org/wiki/Pig_latin> for more details.
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/prime-factors/README.md

@@ -29,7 +29,7 @@ You can check this yourself:
 - = 60
 - Success!
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/raindrops/README.md

@@ -17,7 +17,7 @@ Convert a number to a string, the contents of which depend on the number's facto
 - 34 has four factors: 1, 2, 17, and 34.
   - In raindrop-speak, this would be "34".
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/react/README.md

@@ -15,7 +15,7 @@ In addition, compute cells should allow for registering change notification
 callbacks.  Call a cell’s callbacks when the cell’s value in a new stable
 state has changed from the previous stable state.
 
-
+
 
 
 ## Submitting Incomplete Solutions

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

@@ -18,7 +18,7 @@ each nucleotide with its complement:
 * `T` -> `A`
 * `A` -> `U`
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/robot-name/README.md

@@ -15,7 +15,7 @@ The names must be random: they should not follow a predictable sequence.
 Random names means a risk of collisions. Your solution must ensure that
 every existing robot has a unique name.
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/robot-simulator/README.md

@@ -27,7 +27,7 @@ direction it is pointing.
 - Say a robot starts at {7, 3} facing north. Then running this stream
   of instructions should leave it at {9, 4} facing west.
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/roman-numerals/README.md

@@ -42,7 +42,7 @@ In Roman numerals 1990 is MCMXC:
 
 See also: http://www.novaroma.org/via_romana/numbers.html
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/saddle-points/README.md

@@ -26,7 +26,7 @@ saddle points for any given matrix.
 Note that you may find other definitions of matrix saddle points online,
 but the tests for this exercise follow the above unambiguous definition.
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/scrabble-score/README.md

@@ -37,7 +37,7 @@ And to total:
 - You can play a double or a triple letter.
 - You can play a double or a triple word.
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/secret-handshake/README.md

@@ -28,7 +28,7 @@ Given the input 19, the function would return the array
 Notice that the addition of 16 (10000 in binary)
 has caused the array to be reversed.
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/series/README.md

@@ -20,7 +20,7 @@ whatever you get.
 Note that these series are only required to occupy *adjacent positions*
 in the input; the digits need not be *numerically consecutive*.
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/sieve/README.md

@@ -27,7 +27,7 @@ Notice that this is a very specific algorithm, and the tests don't check
 that you've implemented the algorithm, only that you've come up with the
 correct list of primes.
 
-
+
 
 ## Source
 

data/tracks/kotlin/exercises/simple-cipher/README.md

@@ -47,7 +47,7 @@ Given the key "aaaaaaaaaaaaaaaaaa", encoding the string "iamapandabear"
 would return the original "iamapandabear".
 
 Given the key "ddddddddddddddddd", encoding our string "iamapandabear"
-would return the obscured "lpdsdqgdehdu"
+would return the obscured "ldpdsdqgdehdu"
 
 In the example above, we've set a = 0 for the key value. So when the
 plaintext is added to the key, we end up with the same message coming
@@ -83,7 +83,7 @@ on Wikipedia][dh] for one of the first implementations of this scheme.
 [1]: https://upload.wikimedia.org/wikipedia/commons/thumb/4/4a/Caesar_cipher_left_shift_of_3.svg/320px-Caesar_cipher_left_shift_of_3.svg.png
 [dh]: http://en.wikipedia.org/wiki/Diffie%E2%80%93Hellman_key_exchange
 
-
+
 
 ## Source