trackler 2.2.1.164 → 2.2.1.165

Sign up to get free protection for your applications and to get access to all the features.
Files changed (49) hide show
  1. checksums.yaml +4 -4
  2. data/lib/trackler/version.rb +1 -1
  3. data/tracks/c/exercises/binary-search-tree/README.md +39 -0
  4. data/tracks/c/exercises/bracket-push/README.md +39 -0
  5. data/tracks/c/exercises/crypto-square/README.md +39 -0
  6. data/tracks/c/exercises/diamond/README.md +39 -0
  7. data/tracks/c/exercises/etl/README.md +39 -0
  8. data/tracks/c/exercises/luhn/README.md +39 -0
  9. data/tracks/c/exercises/minesweeper/README.md +35 -0
  10. data/tracks/c/exercises/pig-latin/README.md +43 -4
  11. data/tracks/c/exercises/prime-factors/README.md +39 -0
  12. data/tracks/c/exercises/rna-transcription/README.md +1 -1
  13. data/tracks/c/exercises/run-length-encoding/README.md +39 -0
  14. data/tracks/c/exercises/say/README.md +39 -0
  15. data/tracks/c/exercises/secret-handshake/README.md +39 -0
  16. data/tracks/c/exercises/two-fer/README.md +39 -0
  17. data/tracks/c/exercises/wordy/README.md +39 -0
  18. data/tracks/cpp/config.json +36 -36
  19. data/tracks/cpp/docs/ABOUT.md +1 -1
  20. data/tracks/java/exercises/luhn/.meta/version +1 -0
  21. data/tracks/java/exercises/luhn/src/test/java/LuhnValidatorTest.java +35 -24
  22. data/tracks/javascript/config.json +1 -1
  23. data/tracks/javascript/exercises/nth-prime/example.js +5 -1
  24. data/tracks/javascript/exercises/nth-prime/nth-prime.spec.js +8 -0
  25. data/tracks/kotlin/config.json +60 -60
  26. data/tracks/kotlin/exercises/binary-search/.meta/version +1 -1
  27. data/tracks/kotlin/exercises/flatten-array/.meta/version +1 -1
  28. data/tracks/kotlin/exercises/isogram/.meta/version +1 -1
  29. data/tracks/kotlin/exercises/minesweeper/.meta/version +1 -1
  30. data/tracks/kotlin/exercises/nucleotide-count/.meta/version +1 -1
  31. data/tracks/kotlin/exercises/pig-latin/.meta/version +1 -1
  32. data/tracks/kotlin/exercises/prime-factors/.meta/version +1 -1
  33. data/tracks/kotlin/exercises/spiral-matrix/.meta/version +1 -1
  34. data/tracks/kotlin/exercises/word-count/.meta/version +1 -1
  35. data/tracks/powershell/exercises/hamming/HammingDifference.example.ps1 +12 -2
  36. data/tracks/powershell/exercises/hamming/HammingDifference.ps1 +1 -12
  37. data/tracks/python/exercises/simple-cipher/example.py +11 -15
  38. data/tracks/python/exercises/simple-cipher/simple_cipher.py +0 -5
  39. data/tracks/python/exercises/simple-cipher/simple_cipher_test.py +69 -70
  40. data/tracks/reasonml/bin/new-exercise.sh +11 -0
  41. data/tracks/reasonml/config.json +11 -0
  42. data/tracks/reasonml/exercises/anagram/__tests__/Anagram_test.re +44 -0
  43. data/tracks/reasonml/exercises/anagram/bsconfig.json +30 -0
  44. data/tracks/reasonml/exercises/anagram/package.json +20 -0
  45. data/tracks/reasonml/exercises/anagram/src/Example.re +26 -0
  46. data/tracks/reasonml/template/bsconfig.json +30 -0
  47. data/tracks/reasonml/template/package.json +20 -0
  48. data/tracks/reasonml/template/src/Example.re +0 -0
  49. metadata +11 -2
data/tracks/c/exercises/rna-transcription/README.md CHANGED
@@ -51,7 +51,7 @@ low-level algorithms or facilities by hand.
51
51
 
52
52
  ## Source
53
53
 
54
- Hyperphysics [http://hyperphysics.phy-astr.gsu.edu/hbase/Organic/transcription.html](http://hyperphysics.phy-astr.gsu.edu/hbase/Organic/transcription.html)
54
+ Rosalind [http://rosalind.info/problems/rna](http://rosalind.info/problems/rna)
55
55
 
56
56
  ## Submitting Incomplete Solutions
57
57
  It's possible to submit an incomplete solution so you can see how others have completed the exercise.
data/tracks/c/exercises/run-length-encoding/README.md CHANGED
@@ -1,3 +1,5 @@
1
+ # Run Length Encoding
2
+
1
3
  Implement run-length encoding and decoding.
2
4
 
3
5
  Run-length encoding (RLE) is a simple form of data compression, where runs
@@ -21,3 +23,40 @@ the letters A through Z (either lower or upper case) and whitespace. This way
21
23
  data to be encoded will never contain any numbers and numbers inside data to
22
24
  be decoded always represent the count for the following character.
23
25
 
26
+ ## Getting Started
27
+
28
+ Make sure you have read the
29
+ [C page](http://exercism.io/languages/c) on the Exercism site. This covers
30
+ the basic information on setting up the development environment expected
31
+ by the exercises.
32
+
33
+
34
+ ## Passing the Tests
35
+
36
+ Get the first test compiling, linking and passing by following the [three
37
+ rules of test-driven development][3-tdd-rules].
38
+
39
+ The included makefile can be used to create and run the tests using the `test`
40
+ task.
41
+
42
+ make test
43
+
44
+ Create just the functions you need to satisfy any compiler errors and get the
45
+ test to fail. Then write just enough code to get the test to pass. Once you've
46
+ done that, move onto the next test.
47
+
48
+ [3-tdd-rules]: http://butunclebob.com/ArticleS.UncleBob.TheThreeRulesOfTdd
49
+
50
+ As you progress through the tests, take the time to refactor your
51
+ implementation for readability and expressiveness and then go on to the next
52
+ test.
53
+
54
+ Try to use standard C99 facilities in preference to writing your own
55
+ low-level algorithms or facilities by hand.
56
+
57
+ ## Source
58
+
59
+ Wikipedia [https://en.wikipedia.org/wiki/Run-length_encoding](https://en.wikipedia.org/wiki/Run-length_encoding)
60
+
61
+ ## Submitting Incomplete Solutions
62
+ It's possible to submit an incomplete solution so you can see how others have completed the exercise.
data/tracks/c/exercises/say/README.md CHANGED
@@ -1,3 +1,5 @@
1
+ # Say
2
+
1
3
  Given a number from 0 to 999,999,999,999, spell out that number in English.
2
4
 
3
5
  ## Step 1
@@ -60,3 +62,40 @@ Use _and_ (correctly) when spelling out the number in English:
60
62
  - 1002 becomes "one thousand and two".
61
63
  - 1323 becomes "one thousand three hundred and twenty-three".
62
64
 
65
+ ## Getting Started
66
+
67
+ Make sure you have read the
68
+ [C page](http://exercism.io/languages/c) on the Exercism site. This covers
69
+ the basic information on setting up the development environment expected
70
+ by the exercises.
71
+
72
+
73
+ ## Passing the Tests
74
+
75
+ Get the first test compiling, linking and passing by following the [three
76
+ rules of test-driven development][3-tdd-rules].
77
+
78
+ The included makefile can be used to create and run the tests using the `test`
79
+ task.
80
+
81
+ make test
82
+
83
+ Create just the functions you need to satisfy any compiler errors and get the
84
+ test to fail. Then write just enough code to get the test to pass. Once you've
85
+ done that, move onto the next test.
86
+
87
+ [3-tdd-rules]: http://butunclebob.com/ArticleS.UncleBob.TheThreeRulesOfTdd
88
+
89
+ As you progress through the tests, take the time to refactor your
90
+ implementation for readability and expressiveness and then go on to the next
91
+ test.
92
+
93
+ Try to use standard C99 facilities in preference to writing your own
94
+ low-level algorithms or facilities by hand.
95
+
96
+ ## Source
97
+
98
+ A variation on JavaRanch CattleDrive, exercise 4a [http://www.javaranch.com/say.jsp](http://www.javaranch.com/say.jsp)
99
+
100
+ ## Submitting Incomplete Solutions
101
+ It's possible to submit an incomplete solution so you can see how others have completed the exercise.
data/tracks/c/exercises/secret-handshake/README.md CHANGED
@@ -1,3 +1,5 @@
1
+ # Secret Handshake
2
+
1
3
  > There are 10 types of people in the world: Those who understand
2
4
  > binary, and those who don't.
3
5
 
@@ -26,3 +28,40 @@ Given the input 19, the function would return the array
26
28
  Notice that the addition of 16 (10000 in binary)
27
29
  has caused the array to be reversed.
28
30
 
31
+ ## Getting Started
32
+
33
+ Make sure you have read the
34
+ [C page](http://exercism.io/languages/c) on the Exercism site. This covers
35
+ the basic information on setting up the development environment expected
36
+ by the exercises.
37
+
38
+
39
+ ## Passing the Tests
40
+
41
+ Get the first test compiling, linking and passing by following the [three
42
+ rules of test-driven development][3-tdd-rules].
43
+
44
+ The included makefile can be used to create and run the tests using the `test`
45
+ task.
46
+
47
+ make test
48
+
49
+ Create just the functions you need to satisfy any compiler errors and get the
50
+ test to fail. Then write just enough code to get the test to pass. Once you've
51
+ done that, move onto the next test.
52
+
53
+ [3-tdd-rules]: http://butunclebob.com/ArticleS.UncleBob.TheThreeRulesOfTdd
54
+
55
+ As you progress through the tests, take the time to refactor your
56
+ implementation for readability and expressiveness and then go on to the next
57
+ test.
58
+
59
+ Try to use standard C99 facilities in preference to writing your own
60
+ low-level algorithms or facilities by hand.
61
+
62
+ ## Source
63
+
64
+ Bert, in Mary Poppins [http://www.imdb.com/title/tt0058331/quotes/qt0437047](http://www.imdb.com/title/tt0058331/quotes/qt0437047)
65
+
66
+ ## Submitting Incomplete Solutions
67
+ It's possible to submit an incomplete solution so you can see how others have completed the exercise.
data/tracks/c/exercises/two-fer/README.md CHANGED
@@ -1,3 +1,5 @@
1
+ # Two Fer
2
+
1
3
  `Two-fer` or `2-fer` is short for two for one. One for you and one for me.
2
4
 
3
5
  ```text
@@ -10,3 +12,40 @@ If the given name is "Alice", the result should be "One for Alice, one for me."
10
12
  If no name is given, the result should be "One for you, one for me."
11
13
 
12
14
 
15
+ ## Getting Started
16
+
17
+ Make sure you have read the
18
+ [C page](http://exercism.io/languages/c) on the Exercism site. This covers
19
+ the basic information on setting up the development environment expected
20
+ by the exercises.
21
+
22
+
23
+ ## Passing the Tests
24
+
25
+ Get the first test compiling, linking and passing by following the [three
26
+ rules of test-driven development][3-tdd-rules].
27
+
28
+ The included makefile can be used to create and run the tests using the `test`
29
+ task.
30
+
31
+ make test
32
+
33
+ Create just the functions you need to satisfy any compiler errors and get the
34
+ test to fail. Then write just enough code to get the test to pass. Once you've
35
+ done that, move onto the next test.
36
+
37
+ [3-tdd-rules]: http://butunclebob.com/ArticleS.UncleBob.TheThreeRulesOfTdd
38
+
39
+ As you progress through the tests, take the time to refactor your
40
+ implementation for readability and expressiveness and then go on to the next
41
+ test.
42
+
43
+ Try to use standard C99 facilities in preference to writing your own
44
+ low-level algorithms or facilities by hand.
45
+
46
+ ## Source
47
+
48
+ This is an exercise to introduce users to basic programming constructs, just after Hello World. [https://en.wikipedia.org/wiki/Two-fer](https://en.wikipedia.org/wiki/Two-fer)
49
+
50
+ ## Submitting Incomplete Solutions
51
+ It's possible to submit an incomplete solution so you can see how others have completed the exercise.
data/tracks/c/exercises/wordy/README.md CHANGED
@@ -1,3 +1,5 @@
1
+ # Wordy
2
+
1
3
  Parse and evaluate simple math word problems returning the answer as an integer.
2
4
 
3
5
  ## Iteration 1 — Addition
@@ -49,3 +51,40 @@ If you'd like, handle exponentials.
49
51
 
50
52
  32
51
53
 
54
+ ## Getting Started
55
+
56
+ Make sure you have read the
57
+ [C page](http://exercism.io/languages/c) on the Exercism site. This covers
58
+ the basic information on setting up the development environment expected
59
+ by the exercises.
60
+
61
+
62
+ ## Passing the Tests
63
+
64
+ Get the first test compiling, linking and passing by following the [three
65
+ rules of test-driven development][3-tdd-rules].
66
+
67
+ The included makefile can be used to create and run the tests using the `test`
68
+ task.
69
+
70
+ make test
71
+
72
+ Create just the functions you need to satisfy any compiler errors and get the
73
+ test to fail. Then write just enough code to get the test to pass. Once you've
74
+ done that, move onto the next test.
75
+
76
+ [3-tdd-rules]: http://butunclebob.com/ArticleS.UncleBob.TheThreeRulesOfTdd
77
+
78
+ As you progress through the tests, take the time to refactor your
79
+ implementation for readability and expressiveness and then go on to the next
80
+ test.
81
+
82
+ Try to use standard C99 facilities in preference to writing your own
83
+ low-level algorithms or facilities by hand.
84
+
85
+ ## Source
86
+
87
+ Inspired by one of the generated questions in the Extreme Startup game. [https://github.com/rchatley/extreme_startup](https://github.com/rchatley/extreme_startup)
88
+
89
+ ## Submitting Incomplete Solutions
90
+ It's possible to submit an incomplete solution so you can see how others have completed the exercise.
data/tracks/cpp/config.json CHANGED
@@ -9,7 +9,7 @@
9
9
  {
10
10
  "slug": "hello-world",
11
11
  "uuid": "3eeadff6-82b6-43be-8834-d9ef258e454d",
12
- "core": false,
12
+ "core": true,
13
13
  "auto_approve": true,
14
14
  "unlocked_by": null,
15
15
  "difficulty": 1,
@@ -20,7 +20,7 @@
20
20
  {
21
21
  "slug": "leap",
22
22
  "uuid": "76a840c7-24f1-455d-b62e-da42b13f8dd5",
23
- "core": false,
23
+ "core": true,
24
24
  "unlocked_by": null,
25
25
  "difficulty": 1,
26
26
  "topics": [
@@ -31,7 +31,7 @@
31
31
  {
32
32
  "slug": "gigasecond",
33
33
  "uuid": "4dbe1bb3-0419-4749-8c2a-ec91539a8640",
34
- "core": false,
34
+ "core": true,
35
35
  "unlocked_by": null,
36
36
  "difficulty": 2,
37
37
  "topics": [
@@ -43,7 +43,7 @@
43
43
  "slug": "hamming",
44
44
  "uuid": "a9716747-8cc6-4529-b5d2-dc24bd8641a8",
45
45
  "core": false,
46
- "unlocked_by": null,
46
+ "unlocked_by": "hello-world",
47
47
  "difficulty": 3,
48
48
  "topics": [
49
49
  "control_flow_loops",
@@ -54,7 +54,7 @@
54
54
  "slug": "bob",
55
55
  "uuid": "d80210b8-45e8-4e5c-8b07-9e87c33c5959",
56
56
  "core": false,
57
- "unlocked_by": null,
57
+ "unlocked_by": "raindrops",
58
58
  "difficulty": 5,
59
59
  "topics": [
60
60
  "control_flow_conditionals",
@@ -66,7 +66,7 @@
66
66
  "slug": "anagram",
67
67
  "uuid": "a34d1c83-fb96-4b7a-aeca-fdb17cf91a75",
68
68
  "core": false,
69
- "unlocked_by": null,
69
+ "unlocked_by": "pangram",
70
70
  "difficulty": 5,
71
71
  "topics": [
72
72
  "arrays",
@@ -78,7 +78,7 @@
78
78
  "slug": "etl",
79
79
  "uuid": "0dd45f6a-c6cd-4549-a56b-7babe0a71add",
80
80
  "core": false,
81
- "unlocked_by": null,
81
+ "unlocked_by": "pangram",
82
82
  "difficulty": 3,
83
83
  "topics": [
84
84
  "arrays",
@@ -90,7 +90,7 @@
90
90
  "slug": "word-count",
91
91
  "uuid": "d531e2b1-28bc-4025-b3a7-119d314b5a80",
92
92
  "core": false,
93
- "unlocked_by": null,
93
+ "unlocked_by": "raindrops",
94
94
  "difficulty": 5,
95
95
  "topics": [
96
96
  "arrays",
@@ -103,7 +103,7 @@
103
103
  "slug": "difference-of-squares",
104
104
  "uuid": "46cb230c-8ce9-431d-9dea-a195a3abd117",
105
105
  "core": false,
106
- "unlocked_by": null,
106
+ "unlocked_by": "leap",
107
107
  "difficulty": 3,
108
108
  "topics": [
109
109
  "control_flow_loops"
@@ -113,7 +113,7 @@
113
113
  "slug": "nucleotide-count",
114
114
  "uuid": "949f5680-a7a5-4c1e-ac19-bb4bae658d5c",
115
115
  "core": false,
116
- "unlocked_by": null,
116
+ "unlocked_by": "hello-world",
117
117
  "difficulty": 3,
118
118
  "topics": [
119
119
  "parsing",
@@ -124,7 +124,7 @@
124
124
  "slug": "food-chain",
125
125
  "uuid": "6805ef10-ab91-4d97-af80-9d326255497d",
126
126
  "core": false,
127
- "unlocked_by": null,
127
+ "unlocked_by": "grains",
128
128
  "difficulty": 7,
129
129
  "topics": [
130
130
  "control_flow_loops",
@@ -136,7 +136,7 @@
136
136
  "slug": "phone-number",
137
137
  "uuid": "76491cb2-25a8-4495-ba3e-85aace65319e",
138
138
  "core": false,
139
- "unlocked_by": null,
139
+ "unlocked_by": "grains",
140
140
  "difficulty": 5,
141
141
  "topics": [
142
142
  "parsing",
@@ -147,7 +147,7 @@
147
147
  "slug": "grade-school",
148
148
  "uuid": "a15922b1-467f-4db4-a023-0bb262333551",
149
149
  "core": false,
150
- "unlocked_by": null,
150
+ "unlocked_by": "hello-world",
151
151
  "difficulty": 3,
152
152
  "topics": [
153
153
  "arrays",
@@ -158,7 +158,7 @@
158
158
  "slug": "robot-name",
159
159
  "uuid": "67c3cb10-b893-428a-82d0-79602aef2775",
160
160
  "core": false,
161
- "unlocked_by": null,
161
+ "unlocked_by": "gigasecond",
162
162
  "difficulty": 5,
163
163
  "topics": [
164
164
  "randomness",
@@ -169,7 +169,7 @@
169
169
  "slug": "sum-of-multiples",
170
170
  "uuid": "a190ad11-db1c-4624-a477-e1d0c91d8b4f",
171
171
  "core": false,
172
- "unlocked_by": null,
172
+ "unlocked_by": "gigasecond",
173
173
  "difficulty": 3,
174
174
  "topics": [
175
175
  "mathematics"
@@ -178,7 +178,7 @@
178
178
  {
179
179
  "slug": "space-age",
180
180
  "uuid": "1763159f-3358-42d0-9ad0-2eb90baca600",
181
- "core": false,
181
+ "core": true,
182
182
  "unlocked_by": null,
183
183
  "difficulty": 1,
184
184
  "topics": [
@@ -189,7 +189,7 @@
189
189
  "slug": "meetup",
190
190
  "uuid": "e597f659-f31a-4a1b-a697-d91ede672642",
191
191
  "core": false,
192
- "unlocked_by": null,
192
+ "unlocked_by": "space-age",
193
193
  "difficulty": 5,
194
194
  "topics": [
195
195
  "functions",
@@ -210,7 +210,7 @@
210
210
  {
211
211
  "slug": "triangle",
212
212
  "uuid": "d23a2c36-7182-4fd0-84db-34b27fabda2e",
213
- "core": false,
213
+ "core": true,
214
214
  "unlocked_by": null,
215
215
  "difficulty": 3,
216
216
  "topics": [
@@ -221,7 +221,7 @@
221
221
  {
222
222
  "slug": "grains",
223
223
  "uuid": "c3dc3764-72b9-4926-9747-61db90553e2b",
224
- "core": false,
224
+ "core": true,
225
225
  "unlocked_by": null,
226
226
  "difficulty": 2,
227
227
  "topics": [
@@ -231,7 +231,7 @@
231
231
  {
232
232
  "slug": "raindrops",
233
233
  "uuid": "9155f4ea-3566-4a57-a2c5-76535d931ccc",
234
- "core": false,
234
+ "core": true,
235
235
  "unlocked_by": null,
236
236
  "difficulty": 2,
237
237
  "topics": [
@@ -242,7 +242,7 @@
242
242
  "slug": "roman-numerals",
243
243
  "uuid": "52dce31c-f8ab-44db-accd-573f4b82dcf9",
244
244
  "core": false,
245
- "unlocked_by": null,
245
+ "unlocked_by": "grains",
246
246
  "difficulty": 7,
247
247
  "topics": [
248
248
  "mathematics",
@@ -264,7 +264,7 @@
264
264
  "slug": "prime-factors",
265
265
  "uuid": "ba755932-b301-41cc-b7f2-5e6d2e130325",
266
266
  "core": false,
267
- "unlocked_by": null,
267
+ "unlocked_by": "gigasecond",
268
268
  "difficulty": 5,
269
269
  "topics": [
270
270
  "control_flow_loops",
@@ -275,7 +275,7 @@
275
275
  "slug": "crypto-square",
276
276
  "uuid": "177ecdf4-f249-4193-b9e1-8f1c6480bfad",
277
277
  "core": false,
278
- "unlocked_by": null,
278
+ "unlocked_by": "raindrops",
279
279
  "difficulty": 7,
280
280
  "topics": [
281
281
  "filtering",
@@ -287,7 +287,7 @@
287
287
  "slug": "trinary",
288
288
  "uuid": "c8246de0-29b1-4f92-8b00-b766e395ad66",
289
289
  "core": false,
290
- "unlocked_by": null,
290
+ "unlocked_by": "triangle",
291
291
  "difficulty": 3,
292
292
  "topics": [
293
293
  "mathematics",
@@ -298,7 +298,7 @@
298
298
  "slug": "rna-transcription",
299
299
  "uuid": "2fbd008c-5007-4403-ae71-f4d1f5ccaf8f",
300
300
  "core": false,
301
- "unlocked_by": null,
301
+ "unlocked_by": "hello-world",
302
302
  "difficulty": 3,
303
303
  "topics": [
304
304
  "strings"
@@ -308,7 +308,7 @@
308
308
  "slug": "say",
309
309
  "uuid": "090b2615-cd05-442b-be74-9f11bd5a83a5",
310
310
  "core": false,
311
- "unlocked_by": null,
311
+ "unlocked_by": "leap",
312
312
  "difficulty": 10,
313
313
  "topics": [
314
314
  "logic",
@@ -320,7 +320,7 @@
320
320
  "slug": "sieve",
321
321
  "uuid": "7ea05dd1-2c3c-499e-8608-dc76d30c5457",
322
322
  "core": false,
323
- "unlocked_by": null,
323
+ "unlocked_by": "leap",
324
324
  "difficulty": 5,
325
325
  "topics": [
326
326
  "control_flow_loops",
@@ -331,7 +331,7 @@
331
331
  "slug": "series",
332
332
  "uuid": "0ab70460-3a2f-4c37-bb78-716ba720fe34",
333
333
  "core": false,
334
- "unlocked_by": null,
334
+ "unlocked_by": "grains",
335
335
  "difficulty": 5,
336
336
  "topics": [
337
337
  "arrays",
@@ -343,7 +343,7 @@
343
343
  "slug": "clock",
344
344
  "uuid": "fab94f5a-d4da-4a18-a70a-b27c80b14851",
345
345
  "core": false,
346
- "unlocked_by": null,
346
+ "unlocked_by": "space-age",
347
347
  "difficulty": 5,
348
348
  "topics": [
349
349
  "classes",
@@ -354,7 +354,7 @@
354
354
  "slug": "beer-song",
355
355
  "uuid": "a384c32c-d8db-4877-816b-44de7c3ed324",
356
356
  "core": false,
357
- "unlocked_by": null,
357
+ "unlocked_by": "space-age",
358
358
  "difficulty": 7,
359
359
  "topics": [
360
360
  "strings",
@@ -365,7 +365,7 @@
365
365
  "slug": "nth-prime",
366
366
  "uuid": "675b0a5c-0587-4dc5-8004-1f82769a2ddd",
367
367
  "core": false,
368
- "unlocked_by": null,
368
+ "unlocked_by": "leap",
369
369
  "difficulty": 5,
370
370
  "topics": [
371
371
  "mathematics"
@@ -386,7 +386,7 @@
386
386
  "slug": "queen-attack",
387
387
  "uuid": "0d5e4c9e-4351-41b1-9154-ee900ad0e60e",
388
388
  "core": false,
389
- "unlocked_by": null,
389
+ "unlocked_by": "leap",
390
390
  "difficulty": 5,
391
391
  "topics": [
392
392
  "control_flow_loops",
@@ -397,7 +397,7 @@
397
397
  "slug": "allergies",
398
398
  "uuid": "80ae6a8e-8464-4f3a-afed-14d424757413",
399
399
  "core": false,
400
- "unlocked_by": null,
400
+ "unlocked_by": "gigasecond",
401
401
  "difficulty": 3,
402
402
  "topics": [
403
403
  "bitwise_operations",
@@ -408,7 +408,7 @@
408
408
  "slug": "atbash-cipher",
409
409
  "uuid": "15c741a0-944d-4b06-a096-6af63137347a",
410
410
  "core": false,
411
- "unlocked_by": null,
411
+ "unlocked_by": "triangle",
412
412
  "difficulty": 3,
413
413
  "topics": [
414
414
  "algorithms",
@@ -419,7 +419,7 @@
419
419
  "slug": "bracket-push",
420
420
  "uuid": "4a517292-3472-40f2-b4b8-5c8c25219ea5",
421
421
  "core": false,
422
- "unlocked_by": null,
422
+ "unlocked_by": "pangram",
423
423
  "difficulty": 3,
424
424
  "topics": [
425
425
  "pattern_matching",
@@ -429,7 +429,7 @@
429
429
  {
430
430
  "slug": "pangram",
431
431
  "uuid": "22ada9c4-a2b5-4a54-83d6-597dc3b90b89",
432
- "core": false,
432
+ "core": true,
433
433
  "unlocked_by": null,
434
434
  "difficulty": 2,
435
435
  "topics": [