diff --git a/config.json b/config.json
index 9600ef898..5defaf665 100644
--- a/config.json
+++ b/config.json
@@ -19,11 +19,21 @@
     "average_run_time": 8
   },
   "files": {
-    "solution": ["%{pascal_slug}.fs"],
-    "test": ["%{pascal_slug}Tests.fs"],
-    "example": [".meta/Example.fs"],
-    "exemplar": [".meta/Exemplar.fs"],
-    "invalidator": ["%{pascal_slug}.fsproj"]
+    "solution": [
+      "%{pascal_slug}.fs"
+    ],
+    "test": [
+      "%{pascal_slug}Tests.fs"
+    ],
+    "example": [
+      ".meta/Example.fs"
+    ],
+    "exemplar": [
+      ".meta/Exemplar.fs"
+    ],
+    "invalidator": [
+      "%{pascal_slug}.fsproj"
+    ]
   },
   "exercises": {
     "concept": [
@@ -31,92 +41,154 @@
         "slug": "bird-watcher",
         "name": "Bird Watcher",
         "uuid": "280e8400-1a46-4ef5-b48d-b24611aaace2",
-        "concepts": ["arrays"],
-        "prerequisites": ["booleans", "pattern-matching"]
+        "concepts": [
+          "arrays"
+        ],
+        "prerequisites": [
+          "booleans",
+          "pattern-matching"
+        ]
       },
       {
         "slug": "lucians-luscious-lasagna",
         "name": "Lucian's Luscious Lasagna",
         "uuid": "b439e87d-6acf-40bd-848f-fb7c77dad229",
-        "concepts": ["basics"],
+        "concepts": [
+          "basics"
+        ],
         "prerequisites": []
       },
       {
         "slug": "annalyns-infiltration",
         "name": "Annalyn's Infiltration",
         "uuid": "6ef2a45b-1994-4fb8-b064-637e37881848",
-        "concepts": ["booleans"],
-        "prerequisites": ["basics"]
+        "concepts": [
+          "booleans"
+        ],
+        "prerequisites": [
+          "basics"
+        ]
       },
       {
         "slug": "booking-up-for-beauty",
         "name": "Booking up for Beauty",
         "uuid": "04379e4b-05b0-40cd-992f-705b2494d645",
-        "concepts": ["datetimes"],
-        "prerequisites": ["numbers", "strings"]
+        "concepts": [
+          "datetimes"
+        ],
+        "prerequisites": [
+          "numbers",
+          "strings"
+        ]
       },
       {
         "slug": "valentines-day",
         "name": "Valentine's Day",
         "uuid": "d5305eb9-f87f-44db-a4a4-9e0b5069afe0",
-        "concepts": ["discriminated-unions"],
-        "prerequisites": ["basics"]
+        "concepts": [
+          "discriminated-unions"
+        ],
+        "prerequisites": [
+          "basics"
+        ]
       },
       {
         "slug": "interest-is-interesting",
         "name": "Interest is Interesting",
         "uuid": "fd82bfe4-8725-486b-bc46-1639a83ae158",
-        "concepts": ["floating-point-numbers"],
-        "prerequisites": ["if-then-else-expressions", "numbers"]
+        "concepts": [
+          "floating-point-numbers"
+        ],
+        "prerequisites": [
+          "if-then-else-expressions",
+          "numbers"
+        ]
       },
       {
         "slug": "tracks-on-tracks-on-tracks",
         "name": "Tracks on Tracks on Tracks",
         "uuid": "51f626a6-8e84-4dba-9c9f-b7830000fbe8",
-        "concepts": ["lists"],
-        "prerequisites": ["booleans", "strings", "pattern-matching"]
+        "concepts": [
+          "lists"
+        ],
+        "prerequisites": [
+          "booleans",
+          "strings",
+          "pattern-matching"
+        ]
       },
       {
         "slug": "cars-assemble",
         "name": "Cars, Assemble!",
         "uuid": "85c32aba-5dc0-4dba-9226-63939f3db882",
-        "concepts": ["if-then-else-expressions", "numbers"],
-        "prerequisites": ["booleans"]
+        "concepts": [
+          "if-then-else-expressions",
+          "numbers"
+        ],
+        "prerequisites": [
+          "booleans"
+        ]
       },
       {
         "slug": "guessing-game",
         "name": "Guessing game",
         "uuid": "d605385d-fd8a-45fa-a320-4d7c40213769",
-        "concepts": ["pattern-matching"],
-        "prerequisites": ["if-then-else-expressions", "strings"]
+        "concepts": [
+          "pattern-matching"
+        ],
+        "prerequisites": [
+          "if-then-else-expressions",
+          "strings"
+        ]
       },
       {
         "slug": "bandwagoner",
         "name": "Bandwagoner",
         "uuid": "08ae8519-9dc9-47fe-82ad-8081fe642fe2",
-        "concepts": ["records"],
-        "prerequisites": ["booleans", "numbers", "pattern-matching", "strings"]
+        "concepts": [
+          "records"
+        ],
+        "prerequisites": [
+          "booleans",
+          "numbers",
+          "pattern-matching",
+          "strings"
+        ]
       },
       {
         "slug": "pizza-pricing",
         "name": "Pizza Pricing",
         "uuid": "33a9ea6f-b8c8-4b8e-85c2-45fec1684ea6",
-        "concepts": ["recursion"],
-        "prerequisites": ["discriminated-unions", "pattern-matching"]
+        "concepts": [
+          "recursion"
+        ],
+        "prerequisites": [
+          "discriminated-unions",
+          "pattern-matching"
+        ]
       },
       {
         "slug": "log-levels",
         "name": "Log Levels",
         "uuid": "ab0e683f-46e8-4679-99d2-def4c337e4b8",
-        "concepts": ["strings"],
-        "prerequisites": ["basics"]
+        "concepts": [
+          "strings"
+        ],
+        "prerequisites": [
+          "basics"
+        ]
       },
       {
         "slug": "tisbury-treasure-hunt",
         "name": "Tisbury Treasure Hunt",
         "uuid": "2d397532-9c6c-473d-8af7-d14333e92a60",
-        "concepts": ["tuples"],
-        "prerequisites": ["pattern-matching", "strings"]
+        "concepts": [
+          "tuples"
+        ],
+        "prerequisites": [
+          "pattern-matching",
+          "strings"
+        ]
       }
     ],
     "practice": [
@@ -132,16 +204,27 @@
         "slug": "two-fer",
         "name": "Two Fer",
         "uuid": "2ee3cc7a-db3f-4668-9983-ed6d0fea95d1",
-        "practices": ["string-formatting", "strings"],
-        "prerequisites": ["options", "strings"],
+        "practices": [
+          "string-formatting",
+          "strings"
+        ],
+        "prerequisites": [
+          "options",
+          "strings"
+        ],
         "difficulty": 1
       },
       {
         "slug": "leap",
         "name": "Leap",
         "uuid": "66d974b5-18fc-4993-b5f2-7beda4f4afa3",
-        "practices": ["numbers"],
-        "prerequisites": ["if-then-else-expressions", "numbers"],
+        "practices": [
+          "numbers"
+        ],
+        "prerequisites": [
+          "if-then-else-expressions",
+          "numbers"
+        ],
         "difficulty": 1
       },
       {
@@ -149,7 +232,11 @@
         "name": "Queen Attack",
         "uuid": "528a0023-8687-4524-8318-516d1e432d0d",
         "practices": [],
-        "prerequisites": ["if-then-else-expressions", "numbers", "tuples"],
+        "prerequisites": [
+          "if-then-else-expressions",
+          "numbers",
+          "tuples"
+        ],
         "difficulty": 3
       },
       {
@@ -157,7 +244,11 @@
         "name": "Raindrops",
         "uuid": "0c953a84-e726-4b9f-a964-1950ac2f95f2",
         "practices": [],
-        "prerequisites": ["if-then-else-expressions", "numbers", "strings"],
+        "prerequisites": [
+          "if-then-else-expressions",
+          "numbers",
+          "strings"
+        ],
         "difficulty": 2
       },
       {
@@ -181,7 +272,10 @@
         "slug": "space-age",
         "name": "Space Age",
         "uuid": "277d05db-0ba0-4de6-b5f8-090c251afffc",
-        "practices": ["discriminated-unions", "floating-point-numbers"],
+        "practices": [
+          "discriminated-unions",
+          "floating-point-numbers"
+        ],
         "prerequisites": [
           "discriminated-unions",
           "floating-point-numbers",
@@ -193,31 +287,53 @@
         "slug": "grade-school",
         "name": "Grade School",
         "uuid": "cf058dc8-db6f-4034-ac5b-22f1d8d0decc",
-        "practices": ["ordering"],
-        "prerequisites": ["lists", "numbers", "ordering", "strings", "tuples"],
+        "practices": [
+          "ordering"
+        ],
+        "prerequisites": [
+          "lists",
+          "numbers",
+          "ordering",
+          "strings",
+          "tuples"
+        ],
         "difficulty": 2
       },
       {
         "slug": "clock",
         "name": "Clock",
         "uuid": "30c3a38e-1e44-4711-887e-fca301c26c1b",
-        "practices": ["equality", "numbers"],
-        "prerequisites": ["equality", "numbers"],
+        "practices": [
+          "equality",
+          "numbers"
+        ],
+        "prerequisites": [
+          "equality",
+          "numbers"
+        ],
         "difficulty": 3
       },
       {
         "slug": "bob",
         "name": "Bob",
         "uuid": "b3c4d578-10c8-47bc-b0ae-149ed8da530a",
-        "practices": ["strings"],
-        "prerequisites": ["if-then-else-expressions", "strings"],
+        "practices": [
+          "strings"
+        ],
+        "prerequisites": [
+          "if-then-else-expressions",
+          "strings"
+        ],
         "difficulty": 1
       },
       {
         "slug": "beer-song",
         "name": "Beer Song",
         "uuid": "0ea0d92f-5510-4ba9-b419-3f5ad029b74f",
-        "practices": ["ranges", "string-formatting"],
+        "practices": [
+          "ranges",
+          "string-formatting"
+        ],
         "prerequisites": [
           "lists",
           "numbers",
@@ -231,15 +347,24 @@
         "slug": "kindergarten-garden",
         "name": "Kindergarten Garden",
         "uuid": "cf64cddf-63e2-4c71-ac15-0af617f82856",
-        "practices": ["discriminated-unions"],
-        "prerequisites": ["chars", "discriminated-unions", "strings"],
+        "practices": [
+          "discriminated-unions"
+        ],
+        "prerequisites": [
+          "chars",
+          "discriminated-unions",
+          "strings"
+        ],
         "difficulty": 3
       },
       {
         "slug": "robot-simulator",
         "name": "Robot Simulator",
         "uuid": "ecae4faa-c516-4a71-8d55-9c53403d8826",
-        "practices": ["discriminated-unions", "strings"],
+        "practices": [
+          "discriminated-unions",
+          "strings"
+        ],
         "prerequisites": [
           "chars",
           "discriminated-unions",
@@ -285,15 +410,21 @@
         "slug": "pig-latin",
         "name": "Pig Latin",
         "uuid": "a002e3db-8e9c-4cbf-b00f-f2090bae5d5a",
-        "practices": ["regular-expressions"],
-        "prerequisites": ["strings"],
+        "practices": [
+          "regular-expressions"
+        ],
+        "prerequisites": [
+          "strings"
+        ],
         "difficulty": 6
       },
       {
         "slug": "hamming",
         "name": "Hamming",
         "uuid": "1dadf8c0-b15c-413f-987e-187d043910f0",
-        "practices": ["collection-processing"],
+        "practices": [
+          "collection-processing"
+        ],
         "prerequisites": [
           "for-loops",
           "if-then-else-expressions",
@@ -307,23 +438,40 @@
         "slug": "pangram",
         "name": "Pangram",
         "uuid": "dc133087-0548-49b4-8f17-0c26cf53bcdf",
-        "practices": ["sets", "strings"],
-        "prerequisites": ["booleans", "chars", "strings"],
+        "practices": [
+          "sets",
+          "strings"
+        ],
+        "prerequisites": [
+          "booleans",
+          "chars",
+          "strings"
+        ],
         "difficulty": 2
       },
       {
         "slug": "isogram",
         "name": "Isogram",
         "uuid": "61404a27-62c3-43dc-93b7-7e4547e0a0d9",
-        "practices": ["sets", "strings"],
-        "prerequisites": ["booleans", "chars", "strings"],
+        "practices": [
+          "sets",
+          "strings"
+        ],
+        "prerequisites": [
+          "booleans",
+          "chars",
+          "strings"
+        ],
         "difficulty": 3
       },
       {
         "slug": "twelve-days",
         "name": "Twelve Days",
         "uuid": "89cd6eb1-9671-42bd-a619-59013fb721b0",
-        "practices": ["ranges", "string-formatting"],
+        "practices": [
+          "ranges",
+          "string-formatting"
+        ],
         "prerequisites": [
           "for-loops",
           "lists",
@@ -338,23 +486,41 @@
         "slug": "phone-number",
         "name": "Phone Number",
         "uuid": "929f98e4-a16c-464b-ac6c-59ca86dbd2b6",
-        "practices": ["regular-expressions", "result"],
-        "prerequisites": ["result", "strings"],
+        "practices": [
+          "regular-expressions",
+          "result"
+        ],
+        "prerequisites": [
+          "result",
+          "strings"
+        ],
         "difficulty": 5
       },
       {
         "slug": "high-scores",
         "name": "High Scores",
         "uuid": "c67d7118-2388-4421-baa1-cc3e4f0e2867",
-        "practices": ["collection-processing", "ordering"],
-        "prerequisites": ["constructors", "lists", "numbers", "ordering"],
+        "practices": [
+          "collection-processing",
+          "ordering"
+        ],
+        "prerequisites": [
+          "constructors",
+          "lists",
+          "numbers",
+          "ordering"
+        ],
         "difficulty": 2
       },
       {
         "slug": "bank-account",
         "name": "Bank Account",
         "uuid": "cb629d30-0351-4023-bd51-423267164c24",
-        "practices": ["concurrency", "floating-point-numbers", "members"],
+        "practices": [
+          "concurrency",
+          "floating-point-numbers",
+          "members"
+        ],
         "prerequisites": [
           "classes",
           "floating-point-numbers",
@@ -368,7 +534,10 @@
         "slug": "binary-search-tree",
         "name": "Binary Search Tree",
         "uuid": "4e786e56-2658-445f-ac91-64dd9c38dbb3",
-        "practices": ["constructors", "members"],
+        "practices": [
+          "constructors",
+          "members"
+        ],
         "prerequisites": [
           "classes",
           "constructors",
@@ -383,7 +552,11 @@
         "slug": "pov",
         "name": "POV",
         "uuid": "a6082751-98ca-45dc-aeed-cdd19a8da0ca",
-        "practices": ["equality", "generic-types", "recursion"],
+        "practices": [
+          "equality",
+          "generic-types",
+          "recursion"
+        ],
         "prerequisites": [
           "equality",
           "generic-types",
@@ -398,23 +571,41 @@
         "slug": "zipper",
         "name": "Zipper",
         "uuid": "5369eea9-00c8-4044-b272-1ce8d0590ecf",
-        "practices": ["equality", "immutability", "recursion"],
-        "prerequisites": ["equality", "numbers", "options", "records"],
+        "practices": [
+          "equality",
+          "immutability",
+          "recursion"
+        ],
+        "prerequisites": [
+          "equality",
+          "numbers",
+          "options",
+          "records"
+        ],
         "difficulty": 10
       },
       {
         "slug": "darts",
         "name": "Darts",
         "uuid": "fb3b73e1-673b-4907-821c-f85a157f53c1",
-        "practices": ["floating-point-numbers"],
-        "prerequisites": ["floating-point-numbers", "if-then-else-expressions"],
+        "practices": [
+          "floating-point-numbers"
+        ],
+        "prerequisites": [
+          "floating-point-numbers",
+          "if-then-else-expressions"
+        ],
         "difficulty": 2
       },
       {
         "slug": "grains",
         "name": "Grains",
         "uuid": "e3751098-5a15-4350-bf5d-507583de3386",
-        "practices": ["integral-numbers", "math-operators", "result"],
+        "practices": [
+          "integral-numbers",
+          "math-operators",
+          "result"
+        ],
         "prerequisites": [
           "for-loops",
           "if-then-else-expressions",
@@ -428,7 +619,10 @@
         "slug": "all-your-base",
         "name": "All Your Base",
         "uuid": "01e394ee-23d5-44e6-a37e-149ffaf5375e",
-        "practices": ["math-operators", "while-loops"],
+        "practices": [
+          "math-operators",
+          "while-loops"
+        ],
         "prerequisites": [
           "lists",
           "math-operators",
@@ -442,7 +636,10 @@
         "slug": "largest-series-product",
         "name": "Largest Series Product",
         "uuid": "b3643992-583b-4e7a-a970-94bc7ae6739a",
-        "practices": ["integral-numbers", "math-operators"],
+        "practices": [
+          "integral-numbers",
+          "math-operators"
+        ],
         "prerequisites": [
           "chars",
           "for-loops",
@@ -477,8 +674,14 @@
         "slug": "nth-prime",
         "name": "Nth Prime",
         "uuid": "220cbe7e-e781-4ab9-84ec-2b89a3c97670",
-        "practices": ["lazy-evaluation", "yield"],
-        "prerequisites": ["numbers", "options"],
+        "practices": [
+          "lazy-evaluation",
+          "yield"
+        ],
+        "prerequisites": [
+          "numbers",
+          "options"
+        ],
         "difficulty": 6
       },
       {
@@ -507,7 +710,11 @@
         "slug": "diffie-hellman",
         "name": "Diffie-Hellman",
         "uuid": "2a7e3e78-ab94-40f3-8f16-1d5aa84c2f85",
-        "practices": ["big-integers", "math-operators", "randomness"],
+        "practices": [
+          "big-integers",
+          "math-operators",
+          "randomness"
+        ],
         "prerequisites": [
           "big-integers",
           "lists",
@@ -520,7 +727,12 @@
         "slug": "custom-set",
         "name": "Custom Set",
         "uuid": "ecee74aa-41f5-42aa-b99e-31e9589378e3",
-        "practices": ["constructors", "generic-types", "immutability", "sets"],
+        "practices": [
+          "constructors",
+          "generic-types",
+          "immutability",
+          "sets"
+        ],
         "prerequisites": [
           "booleans",
           "constructors",
@@ -537,7 +749,9 @@
         "slug": "run-length-encoding",
         "name": "Run-Length Encoding",
         "uuid": "0a10cd0b-ea37-4c78-a6a4-223203ac1c37",
-        "practices": ["strings"],
+        "practices": [
+          "strings"
+        ],
         "prerequisites": [
           "booleans",
           "for-loops",
@@ -550,7 +764,10 @@
         "slug": "palindrome-products",
         "name": "Palindrome Products",
         "uuid": "471c89f9-8b27-4898-8e98-58e4b2921616",
-        "practices": ["exceptions", "generic-methods"],
+        "practices": [
+          "exceptions",
+          "generic-methods"
+        ],
         "prerequisites": [
           "exceptions",
           "generic-methods",
@@ -565,7 +782,10 @@
         "slug": "word-search",
         "name": "Word Search",
         "uuid": "8f8a79d1-78ed-4cdd-adcc-5cd6c6781dcd",
-        "practices": ["constructors", "nullability"],
+        "practices": [
+          "constructors",
+          "nullability"
+        ],
         "prerequisites": [
           "constructors",
           "lists",
@@ -581,8 +801,15 @@
         "slug": "dominoes",
         "name": "Dominoes",
         "uuid": "f09d34d3-f12c-4c9a-9083-68172478278e",
-        "practices": ["lazy-evaluation"],
-        "prerequisites": ["booleans", "lists", "numbers", "tuples"],
+        "practices": [
+          "lazy-evaluation"
+        ],
+        "prerequisites": [
+          "booleans",
+          "lists",
+          "numbers",
+          "tuples"
+        ],
         "difficulty": 7
       },
       {
@@ -590,7 +817,9 @@
         "name": "Sieve",
         "uuid": "a6511471-bc2c-4734-92fe-c6c5cf447efd",
         "practices": [],
-        "prerequisites": ["numbers"],
+        "prerequisites": [
+          "numbers"
+        ],
         "difficulty": 3
       },
       {
@@ -617,7 +846,10 @@
         "slug": "robot-name",
         "name": "Robot Name",
         "uuid": "3fbd466a-caf4-48ac-9a1e-796bc406ff1e",
-        "practices": ["classes", "randomness"],
+        "practices": [
+          "classes",
+          "randomness"
+        ],
         "prerequisites": [
           "classes",
           "randomness",
@@ -631,7 +863,9 @@
         "slug": "food-chain",
         "name": "Food Chain",
         "uuid": "f4dee9ea-fcdf-4623-8ae1-13bdf995f2cb",
-        "practices": ["string-formatting"],
+        "practices": [
+          "string-formatting"
+        ],
         "prerequisites": [
           "for-loops",
           "if-then-else-expressions",
@@ -666,7 +900,10 @@
         "slug": "ledger",
         "name": "Ledger",
         "uuid": "e860ad86-cd1f-474b-9e8e-d8a72ff4315c",
-        "practices": ["globalization", "string-formatting"],
+        "practices": [
+          "globalization",
+          "string-formatting"
+        ],
         "prerequisites": [
           "globalization",
           "lists",
@@ -698,15 +935,24 @@
         "slug": "pascals-triangle",
         "name": "Pascal's Triangle",
         "uuid": "fef76c19-db3c-442d-b2f5-b0dfae19ee43",
-        "practices": ["yield"],
-        "prerequisites": ["for-loops", "lists", "numbers"],
+        "practices": [
+          "yield"
+        ],
+        "prerequisites": [
+          "for-loops",
+          "lists",
+          "numbers"
+        ],
         "difficulty": 4
       },
       {
         "slug": "book-store",
         "name": "Book Store",
         "uuid": "3741977a-adff-47bb-a9c5-c2e444805bac",
-        "practices": ["floating-point-numbers", "recursion"],
+        "practices": [
+          "floating-point-numbers",
+          "recursion"
+        ],
         "prerequisites": [
           "floating-point-numbers",
           "for-loops",
@@ -719,7 +965,11 @@
         "slug": "roman-numerals",
         "name": "Roman Numerals",
         "uuid": "2e88193d-9f80-4d83-901b-bb5ac4b0804c",
-        "practices": ["extension-methods", "numbers", "while-loops"],
+        "practices": [
+          "extension-methods",
+          "numbers",
+          "while-loops"
+        ],
         "prerequisites": [
           "extension-methods",
           "numbers",
@@ -732,23 +982,39 @@
         "slug": "change",
         "name": "Change",
         "uuid": "03a1c773-5c48-4f70-a2de-b742197fa9d2",
-        "practices": ["collection-processing"],
-        "prerequisites": ["lists", "numbers", "options"],
+        "practices": [
+          "collection-processing"
+        ],
+        "prerequisites": [
+          "lists",
+          "numbers",
+          "options"
+        ],
         "difficulty": 7
       },
       {
         "slug": "armstrong-numbers",
         "name": "Armstrong Numbers",
         "uuid": "e7f74f6c-16ea-40d8-94f7-7034bc6ee938",
-        "practices": ["casting"],
-        "prerequisites": ["booleans", "casting", "numbers"],
+        "practices": [
+          "casting"
+        ],
+        "prerequisites": [
+          "booleans",
+          "casting",
+          "numbers"
+        ],
         "difficulty": 2
       },
       {
         "slug": "collatz-conjecture",
         "name": "Collatz Conjecture",
         "uuid": "8b66e691-508f-40d9-8cee-1d6aec27366e",
-        "practices": ["numbers", "recursion", "while-loops"],
+        "practices": [
+          "numbers",
+          "recursion",
+          "while-loops"
+        ],
         "prerequisites": [
           "if-then-else-expressions",
           "numbers",
@@ -761,8 +1027,15 @@
         "slug": "binary-search",
         "name": "Binary Search",
         "uuid": "c5b38251-14ba-4d98-a420-7a930f06167f",
-        "practices": ["arrays"],
-        "prerequisites": ["arrays", "for-loops", "numbers", "options"],
+        "practices": [
+          "arrays"
+        ],
+        "prerequisites": [
+          "arrays",
+          "for-loops",
+          "numbers",
+          "options"
+        ],
         "difficulty": 3
       },
       {
@@ -792,23 +1065,37 @@
         "slug": "perfect-numbers",
         "name": "Perfect Numbers",
         "uuid": "45fcf742-1b3a-422a-b476-5ee81d80057a",
-        "practices": ["numbers"],
-        "prerequisites": ["discriminated-unions", "numbers", "options"],
+        "practices": [
+          "numbers"
+        ],
+        "prerequisites": [
+          "discriminated-unions",
+          "numbers",
+          "options"
+        ],
         "difficulty": 3
       },
       {
         "slug": "protein-translation",
         "name": "Protein Translation",
         "uuid": "612395a5-238e-4be0-8ce0-4ac66f57056e",
-        "practices": ["collection-processing", "while-loops"],
-        "prerequisites": ["strings", "while-loops"],
+        "practices": [
+          "collection-processing",
+          "while-loops"
+        ],
+        "prerequisites": [
+          "strings",
+          "while-loops"
+        ],
         "difficulty": 3
       },
       {
         "slug": "triangle",
         "name": "Triangle",
         "uuid": "47fd8f98-20d3-43fe-825f-27745e13908d",
-        "practices": ["floating-point-numbers"],
+        "practices": [
+          "floating-point-numbers"
+        ],
         "prerequisites": [
           "booleans",
           "floating-point-numbers",
@@ -820,7 +1107,9 @@
         "slug": "saddle-points",
         "name": "Saddle Points",
         "uuid": "526fc5b4-e96b-419a-8987-9b78e9bddc19",
-        "practices": ["multi-dimensional-arrays"],
+        "practices": [
+          "multi-dimensional-arrays"
+        ],
         "prerequisites": [
           "generic-methods",
           "lists",
@@ -834,31 +1123,54 @@
         "slug": "simple-linked-list",
         "name": "Simple Linked List",
         "uuid": "e86e88a0-802c-41f4-b2a1-c7a81b8e87de",
-        "practices": ["interfaces", "members"],
-        "prerequisites": ["interfaces", "lists", "members", "numbers"],
+        "practices": [
+          "interfaces",
+          "members"
+        ],
+        "prerequisites": [
+          "interfaces",
+          "lists",
+          "members",
+          "numbers"
+        ],
         "difficulty": 4
       },
       {
         "slug": "linked-list",
         "name": "Linked List",
         "uuid": "253f040d-35c2-4e1c-8651-d7a7410d7d0d",
-        "practices": ["generic-types"],
-        "prerequisites": ["classes", "generic-types", "numbers", "records"],
+        "practices": [
+          "generic-types"
+        ],
+        "prerequisites": [
+          "classes",
+          "generic-types",
+          "numbers",
+          "records"
+        ],
         "difficulty": 5
       },
       {
         "slug": "yacht",
         "name": "Yacht",
         "uuid": "005721ef-264e-4f81-ae63-ae72b0e5310f",
-        "practices": ["collection-processing", "discriminated-unions"],
-        "prerequisites": ["discriminated-unions", "numbers"],
+        "practices": [
+          "collection-processing",
+          "discriminated-unions"
+        ],
+        "prerequisites": [
+          "discriminated-unions",
+          "numbers"
+        ],
         "difficulty": 5
       },
       {
         "slug": "poker",
         "name": "Poker",
         "uuid": "411b93d0-214d-4d46-9081-16b9dd376174",
-        "practices": ["ordering"],
+        "practices": [
+          "ordering"
+        ],
         "prerequisites": [
           "generic-methods",
           "if-then-else-expressions",
@@ -871,8 +1183,16 @@
         "slug": "etl",
         "name": "ETL",
         "uuid": "95e592a8-6663-4b07-894a-86a5cc310c67",
-        "practices": ["collection-processing"],
-        "prerequisites": ["lists", "maps", "numbers", "strings", "tuples"],
+        "practices": [
+          "collection-processing"
+        ],
+        "prerequisites": [
+          "lists",
+          "maps",
+          "numbers",
+          "strings",
+          "tuples"
+        ],
         "difficulty": 2
       },
       {
@@ -896,8 +1216,16 @@
         "slug": "word-count",
         "name": "Word Count",
         "uuid": "0c7a2f06-1e53-4043-9e1a-386e90e945b4",
-        "practices": ["regular-expressions"],
-        "prerequisites": ["lists", "maps", "numbers", "strings", "tuples"],
+        "practices": [
+          "regular-expressions"
+        ],
+        "prerequisites": [
+          "lists",
+          "maps",
+          "numbers",
+          "strings",
+          "tuples"
+        ],
         "difficulty": 4
       },
       {
@@ -905,30 +1233,48 @@
         "name": "Scrabble Score",
         "uuid": "e22fcca5-b23c-4feb-972f-9795dd1bd946",
         "practices": [],
-        "prerequisites": ["numbers", "strings"],
+        "prerequisites": [
+          "numbers",
+          "strings"
+        ],
         "difficulty": 3
       },
       {
         "slug": "meetup",
         "name": "Meetup",
         "uuid": "3ce04665-95d1-4608-9763-5ee1b5f2584c",
-        "practices": ["datetimes"],
-        "prerequisites": ["datetimes", "tuples"],
+        "practices": [
+          "datetimes"
+        ],
+        "prerequisites": [
+          "datetimes",
+          "tuples"
+        ],
         "difficulty": 4
       },
       {
         "slug": "dot-dsl",
         "name": "DOT DSL",
         "uuid": "dc50364b-b5b6-4e0b-ba58-32fb7d60a93b",
-        "practices": ["classes", "equality"],
-        "prerequisites": ["classes", "equality", "lists", "tuples"],
+        "practices": [
+          "classes",
+          "equality"
+        ],
+        "prerequisites": [
+          "classes",
+          "equality",
+          "lists",
+          "tuples"
+        ],
         "difficulty": 5
       },
       {
         "slug": "parallel-letter-frequency",
         "name": "Parallel Letter Frequency",
         "uuid": "c0d0ae0f-83fb-433a-8778-d38e8a6645aa",
-        "practices": ["parallellism"],
+        "practices": [
+          "parallellism"
+        ],
         "prerequisites": [
           "lists",
           "maps",
@@ -943,7 +1289,9 @@
         "slug": "rest-api",
         "name": "REST API",
         "uuid": "b0aaf5ac-f94d-4995-af4a-b27068cf540e",
-        "practices": ["optional-parameters"],
+        "practices": [
+          "optional-parameters"
+        ],
         "prerequisites": [
           "constructors",
           "lists",
@@ -957,7 +1305,10 @@
         "slug": "bowling",
         "name": "Bowling",
         "uuid": "1c8ad2ca-4aec-47af-94b1-ef7e2830b463",
-        "practices": ["classes", "nullability"],
+        "practices": [
+          "classes",
+          "nullability"
+        ],
         "prerequisites": [
           "classes",
           "lists",
@@ -965,14 +1316,20 @@
           "numbers",
           "options"
         ],
-        "difficulty": 6
-      },
-      {
-        "slug": "affine-cipher",
-        "name": "Affine Cipher",
-        "uuid": "ae2f8b66-1d5f-4c19-ad84-b9a7e9e87d0e",
-        "practices": ["exceptions"],
-        "prerequisites": ["exceptions", "numbers", "strings"],
+        "difficulty": 6
+      },
+      {
+        "slug": "affine-cipher",
+        "name": "Affine Cipher",
+        "uuid": "ae2f8b66-1d5f-4c19-ad84-b9a7e9e87d0e",
+        "practices": [
+          "exceptions"
+        ],
+        "prerequisites": [
+          "exceptions",
+          "numbers",
+          "strings"
+        ],
         "difficulty": 3
       },
       {
@@ -980,46 +1337,79 @@
         "name": "Proverb",
         "uuid": "5ca0e0ba-20ac-4d48-b2dc-0cdde06a8f3e",
         "practices": [],
-        "prerequisites": ["for-loops", "lists", "strings"],
+        "prerequisites": [
+          "for-loops",
+          "lists",
+          "strings"
+        ],
         "difficulty": 3
       },
       {
         "slug": "acronym",
         "name": "Acronym",
         "uuid": "926f9309-e0bb-457a-8f1d-8fa947ed5ce7",
-        "practices": ["regular-expressions", "strings"],
-        "prerequisites": ["booleans", "chars", "strings"],
+        "practices": [
+          "regular-expressions",
+          "strings"
+        ],
+        "prerequisites": [
+          "booleans",
+          "chars",
+          "strings"
+        ],
         "difficulty": 4
       },
       {
         "slug": "anagram",
         "name": "Anagram",
         "uuid": "cffcb076-295f-497f-8ef1-059a8fa65536",
-        "practices": ["classes", "strings"],
-        "prerequisites": ["classes", "strings"],
+        "practices": [
+          "classes",
+          "strings"
+        ],
+        "prerequisites": [
+          "classes",
+          "strings"
+        ],
         "difficulty": 4
       },
       {
         "slug": "house",
         "name": "House",
         "uuid": "7d339c98-74ea-49d5-a97c-c0417e28468a",
-        "practices": ["string-formatting"],
-        "prerequisites": ["lists", "numbers", "string-formatting", "strings"],
+        "practices": [
+          "string-formatting"
+        ],
+        "prerequisites": [
+          "lists",
+          "numbers",
+          "string-formatting",
+          "strings"
+        ],
         "difficulty": 4
       },
       {
         "slug": "isbn-verifier",
         "name": "ISBN Verifier",
         "uuid": "c339c32c-3310-4b8c-b4e6-0f9f651064b7",
-        "practices": ["regular-expressions"],
-        "prerequisites": ["booleans", "chars", "strings"],
+        "practices": [
+          "regular-expressions"
+        ],
+        "prerequisites": [
+          "booleans",
+          "chars",
+          "strings"
+        ],
         "difficulty": 4
       },
       {
         "slug": "series",
         "name": "Series",
         "uuid": "4b07842c-dcef-4be0-a842-0b3b7a30c499",
-        "practices": ["for-loops", "yield"],
+        "practices": [
+          "for-loops",
+          "yield"
+        ],
         "prerequisites": [
           "collection-processing",
           "for-loops",
@@ -1034,15 +1424,24 @@
         "name": "Atbash Cipher",
         "uuid": "3fb37bef-a754-4a64-8493-ba4254518017",
         "practices": [],
-        "prerequisites": ["chars", "for-loops", "strings"],
+        "prerequisites": [
+          "chars",
+          "for-loops",
+          "strings"
+        ],
         "difficulty": 5
       },
       {
         "slug": "crypto-square",
         "name": "Crypto Square",
         "uuid": "8d381a54-04a1-45d3-84d3-933b0d94f440",
-        "practices": ["collection-processing"],
-        "prerequisites": ["collection-processing", "strings"],
+        "practices": [
+          "collection-processing"
+        ],
+        "prerequisites": [
+          "collection-processing",
+          "strings"
+        ],
         "difficulty": 5
       },
       {
@@ -1050,22 +1449,37 @@
         "name": "Luhn",
         "uuid": "85ab318f-7842-486d-88de-f0ff7fbef069",
         "practices": [],
-        "prerequisites": ["chars", "for-loops", "numbers", "strings"],
+        "prerequisites": [
+          "chars",
+          "for-loops",
+          "numbers",
+          "strings"
+        ],
         "difficulty": 5
       },
       {
         "slug": "rotational-cipher",
         "name": "Rotational Cipher",
         "uuid": "26b00c8d-6282-48a8-b017-2ed3e6d48267",
-        "practices": ["strings"],
-        "prerequisites": ["chars", "numbers", "strings"],
+        "practices": [
+          "strings"
+        ],
+        "prerequisites": [
+          "chars",
+          "numbers",
+          "strings"
+        ],
         "difficulty": 5
       },
       {
         "slug": "simple-cipher",
         "name": "Simple Cipher",
         "uuid": "df6f311b-9deb-4d07-9a29-3d881556513e",
-        "practices": ["classes", "members", "randomness"],
+        "practices": [
+          "classes",
+          "members",
+          "randomness"
+        ],
         "prerequisites": [
           "classes",
           "for-loops",
@@ -1080,7 +1494,10 @@
         "slug": "tournament",
         "name": "Tournament",
         "uuid": "b5672a0c-aac5-4274-a458-39d018b74750",
-        "practices": ["streams", "string-formatting"],
+        "practices": [
+          "streams",
+          "string-formatting"
+        ],
         "prerequisites": [
           "lists",
           "records",
@@ -1094,7 +1511,10 @@
         "slug": "diamond",
         "name": "Diamond",
         "uuid": "736a470f-412c-41fc-b92d-9bd59ef3bcce",
-        "practices": ["string-builder", "string-formatting"],
+        "practices": [
+          "string-builder",
+          "string-formatting"
+        ],
         "prerequisites": [
           "chars",
           "lists",
@@ -1108,15 +1528,24 @@
         "slug": "matrix",
         "name": "Matrix",
         "uuid": "632417fa-7bf7-4228-9b71-dbdd6738b223",
-        "practices": ["classes", "members"],
-        "prerequisites": ["classes", "members", "numbers"],
+        "practices": [
+          "classes",
+          "members"
+        ],
+        "prerequisites": [
+          "classes",
+          "members",
+          "numbers"
+        ],
         "difficulty": 4
       },
       {
         "slug": "markdown",
         "name": "Markdown",
         "uuid": "0688eb10-9581-45c0-a69a-13f20d534cb0",
-        "practices": ["string-builder"],
+        "practices": [
+          "string-builder"
+        ],
         "prerequisites": [
           "if-then-else-expressions",
           "string-formatting",
@@ -1129,14 +1558,20 @@
         "name": "Scale Generator",
         "uuid": "02a8e767-7449-48a9-8d6b-f2cac708de50",
         "practices": [],
-        "prerequisites": ["for-loops", "strings"],
+        "prerequisites": [
+          "for-loops",
+          "strings"
+        ],
         "difficulty": 5
       },
       {
         "slug": "spiral-matrix",
         "name": "Spiral Matrix",
         "uuid": "52f8f299-b93b-4f44-bd5b-b445741b285d",
-        "practices": ["multi-dimensional-arrays", "numbers"],
+        "practices": [
+          "multi-dimensional-arrays",
+          "numbers"
+        ],
         "prerequisites": [
           "if-then-else-expressions",
           "lists",
@@ -1149,15 +1584,25 @@
         "slug": "matching-brackets",
         "name": "Matching Brackets",
         "uuid": "677ca063-70fe-4cfc-8112-c5d78bd1ea44",
-        "practices": ["stacks"],
-        "prerequisites": ["booleans", "chars", "lists", "stacks", "strings"],
+        "practices": [
+          "stacks"
+        ],
+        "prerequisites": [
+          "booleans",
+          "chars",
+          "lists",
+          "stacks",
+          "strings"
+        ],
         "difficulty": 7
       },
       {
         "slug": "minesweeper",
         "name": "Minesweeper",
         "uuid": "9e3fc78d-ac3b-4195-ad4c-9f99b0ee2678",
-        "practices": ["string-formatting"],
+        "practices": [
+          "string-formatting"
+        ],
         "prerequisites": [
           "chars",
           "if-then-else-expressions",
@@ -1172,7 +1617,9 @@
         "slug": "rectangles",
         "name": "Rectangles",
         "uuid": "d3f364e0-9866-4ec4-8197-dc248b96042b",
-        "practices": ["switch-statements"],
+        "practices": [
+          "switch-statements"
+        ],
         "prerequisites": [
           "for-loops",
           "if-then-else-expressions",
@@ -1186,31 +1633,54 @@
         "slug": "wordy",
         "name": "Wordy",
         "uuid": "c721b3f2-4afc-4a30-bad5-77bd002c2819",
-        "practices": ["regular-expressions", "switch-statements"],
-        "prerequisites": ["numbers", "options", "strings"],
+        "practices": [
+          "regular-expressions",
+          "switch-statements"
+        ],
+        "prerequisites": [
+          "numbers",
+          "options",
+          "strings"
+        ],
         "difficulty": 7
       },
       {
         "slug": "prime-factors",
         "name": "Prime Factors",
         "uuid": "18652e46-6dd2-4030-84af-be0965c92991",
-        "practices": ["integral-numbers", "while-loops"],
-        "prerequisites": ["integral-numbers", "while-loops"],
+        "practices": [
+          "integral-numbers",
+          "while-loops"
+        ],
+        "prerequisites": [
+          "integral-numbers",
+          "while-loops"
+        ],
         "difficulty": 4
       },
       {
         "slug": "pythagorean-triplet",
         "name": "Pythagorean Triplet",
         "uuid": "6bcde851-71ad-4985-b335-8ca67f99c22f",
-        "practices": ["generic-methods"],
-        "prerequisites": ["generic-methods", "numbers", "tuples"],
+        "practices": [
+          "generic-methods"
+        ],
+        "prerequisites": [
+          "generic-methods",
+          "numbers",
+          "tuples"
+        ],
         "difficulty": 4
       },
       {
         "slug": "circular-buffer",
         "name": "Circular Buffer",
         "uuid": "b62f8574-9bac-4b95-a76c-f13789ae2663",
-        "practices": ["exceptions", "generic-types", "queues"],
+        "practices": [
+          "exceptions",
+          "generic-types",
+          "queues"
+        ],
         "prerequisites": [
           "classes",
           "exceptions",
@@ -1226,7 +1696,10 @@
         "slug": "say",
         "name": "Say",
         "uuid": "7af901ca-24ea-4c24-a660-99b1f4338e01",
-        "practices": ["integral-numbers", "while-loops"],
+        "practices": [
+          "integral-numbers",
+          "while-loops"
+        ],
         "prerequisites": [
           "if-then-else-expressions",
           "integral-numbers",
@@ -1240,7 +1713,10 @@
         "slug": "two-bucket",
         "name": "Two Bucket",
         "uuid": "78472676-26f0-4bef-813b-9b958c4c35df",
-        "practices": ["constructors", "members"],
+        "practices": [
+          "constructors",
+          "members"
+        ],
         "prerequisites": [
           "constructors",
           "discriminated-unions",
@@ -1254,23 +1730,37 @@
         "slug": "zebra-puzzle",
         "name": "Zebra Puzzle",
         "uuid": "ee021156-5520-4386-8b5d-9c648f30287c",
-        "practices": ["discriminated-unions", "lazy-evaluation"],
-        "prerequisites": ["discriminated-unions", "records"],
+        "practices": [
+          "discriminated-unions",
+          "lazy-evaluation"
+        ],
+        "prerequisites": [
+          "discriminated-unions",
+          "records"
+        ],
         "difficulty": 8
       },
       {
         "slug": "secret-handshake",
         "name": "Secret Handshake",
         "uuid": "ae78a960-2c55-44cb-9fd0-49b4bd5729c5",
-        "practices": ["bit-manipulation"],
-        "prerequisites": ["bit-manipulation", "strings"],
+        "practices": [
+          "bit-manipulation"
+        ],
+        "prerequisites": [
+          "bit-manipulation",
+          "strings"
+        ],
         "difficulty": 3
       },
       {
         "slug": "variable-length-quantity",
         "name": "Variable Length Quantity",
         "uuid": "ef86703b-9e78-43f8-aa4c-203492ac622c",
-        "practices": ["bit-manipulation", "integral-numbers"],
+        "practices": [
+          "bit-manipulation",
+          "integral-numbers"
+        ],
         "prerequisites": [
           "bit-manipulation",
           "integral-numbers",
@@ -1283,7 +1773,10 @@
         "slug": "connect",
         "name": "Connect",
         "uuid": "dead8124-6942-4205-9ea8-3cb926c0dc47",
-        "practices": ["discriminated-unions", "switch-statements"],
+        "practices": [
+          "discriminated-unions",
+          "switch-statements"
+        ],
         "prerequisites": [
           "chars",
           "discriminated-unions",
@@ -1298,7 +1791,9 @@
         "slug": "alphametics",
         "name": "Alphametics",
         "uuid": "3d682945-5fa1-4121-9d5b-7bac60660de9",
-        "practices": ["lazy-evaluation"],
+        "practices": [
+          "lazy-evaluation"
+        ],
         "prerequisites": [
           "lazy-evaluation",
           "lists",
@@ -1329,7 +1824,10 @@
         "slug": "sgf-parsing",
         "name": "SGF Parsing",
         "uuid": "fe0e98b3-d0d3-4bf6-bfaa-8aa0e61aa625",
-        "practices": ["constructors", "members"],
+        "practices": [
+          "constructors",
+          "members"
+        ],
         "prerequisites": [
           "constructors",
           "lists",
@@ -1345,16 +1843,29 @@
         "slug": "forth",
         "name": "Forth",
         "uuid": "533981a1-632c-4ca8-a4ae-05f3ad1a810b",
-        "practices": ["lazy-evaluation"],
-        "prerequisites": ["lists", "options", "records", "strings"],
+        "practices": [
+          "lazy-evaluation"
+        ],
+        "prerequisites": [
+          "lists",
+          "options",
+          "records",
+          "strings"
+        ],
         "difficulty": 10
       },
       {
         "slug": "rail-fence-cipher",
         "name": "Rail Fence Cipher",
         "uuid": "c418bba8-2185-4b45-92f1-0cfafbbe8ce5",
-        "practices": ["collection-processing"],
-        "prerequisites": ["collection-processing", "numbers", "strings"],
+        "practices": [
+          "collection-processing"
+        ],
+        "prerequisites": [
+          "collection-processing",
+          "numbers",
+          "strings"
+        ],
         "difficulty": 6
       },
       {
@@ -1362,7 +1873,11 @@
         "name": "Transpose",
         "uuid": "3dfedd37-8159-446d-a332-e9d356f484ca",
         "practices": [],
-        "prerequisites": ["for-loops", "lists", "strings"],
+        "prerequisites": [
+          "for-loops",
+          "lists",
+          "strings"
+        ],
         "difficulty": 6
       },
       {
@@ -1388,7 +1903,12 @@
         "slug": "hangman",
         "name": "Hangman",
         "uuid": "ab0f1b66-011f-4aa3-89c5-c89427121279",
-        "practices": ["immutability", "inheritance", "members", "sets"],
+        "practices": [
+          "immutability",
+          "inheritance",
+          "members",
+          "sets"
+        ],
         "prerequisites": [
           "chars",
           "constructors",
@@ -1408,14 +1928,18 @@
         "name": "Lens Person",
         "uuid": "443fdb8c-1a97-4086-be6a-b541faa961a5",
         "practices": [],
-        "prerequisites": ["tuples"],
+        "prerequisites": [
+          "tuples"
+        ],
         "difficulty": 9
       },
       {
         "slug": "react",
         "name": "React",
         "uuid": "8eef5619-f331-46b3-a2c1-d581f523a815",
-        "practices": ["events"],
+        "practices": [
+          "events"
+        ],
         "prerequisites": [
           "classes",
           "events",
@@ -1466,39 +1990,63 @@
         "slug": "difference-of-squares",
         "name": "Difference of Squares",
         "uuid": "3969fb29-5997-4050-adb0-8c6e95f48013",
-        "practices": ["collection-processing", "math-operators", "numbers"],
-        "prerequisites": ["math-operators", "numbers"],
+        "practices": [
+          "collection-processing",
+          "math-operators",
+          "numbers"
+        ],
+        "prerequisites": [
+          "math-operators",
+          "numbers"
+        ],
         "difficulty": 1
       },
       {
         "slug": "gigasecond",
         "name": "Gigasecond",
         "uuid": "1d377268-8892-460b-a84b-011fde1ff06b",
-        "practices": ["datetimes"],
-        "prerequisites": ["datetimes", "numbers"],
+        "practices": [
+          "datetimes"
+        ],
+        "prerequisites": [
+          "datetimes",
+          "numbers"
+        ],
         "difficulty": 1
       },
       {
         "slug": "reverse-string",
         "name": "Reverse String",
         "uuid": "08be451e-65c1-4306-860e-ac0c4a02a546",
-        "practices": ["strings"],
-        "prerequisites": ["for-loops", "strings"],
+        "practices": [
+          "strings"
+        ],
+        "prerequisites": [
+          "for-loops",
+          "strings"
+        ],
         "difficulty": 1
       },
       {
         "slug": "rna-transcription",
         "name": "RNA Transcription",
         "uuid": "3a015501-58bf-427c-8c4c-2197321f4a34",
-        "practices": ["collection-processing"],
-        "prerequisites": ["chars", "strings"],
+        "practices": [
+          "collection-processing"
+        ],
+        "prerequisites": [
+          "chars",
+          "strings"
+        ],
         "difficulty": 1
       },
       {
         "slug": "sum-of-multiples",
         "name": "Sum of Multiples",
         "uuid": "e702b75e-4c9e-40ef-bcb1-674a87222c23",
-        "practices": ["ranges"],
+        "practices": [
+          "ranges"
+        ],
         "prerequisites": [
           "for-loops",
           "booleans",
@@ -1512,7 +2060,9 @@
         "slug": "dnd-character",
         "name": "D&D Character",
         "uuid": "93550ca5-cd8c-42e3-88f3-e6ce41608342",
-        "practices": ["randomness"],
+        "practices": [
+          "randomness"
+        ],
         "prerequisites": [
           "classes",
           "constructors",
@@ -1527,7 +2077,10 @@
         "slug": "tree-building",
         "name": "Tree Building",
         "uuid": "a53fa908-f983-4da5-b1c1-3989bd2ea2f9",
-        "practices": ["discriminated-unions", "exceptions"],
+        "practices": [
+          "discriminated-unions",
+          "exceptions"
+        ],
         "prerequisites": [
           "booleans",
           "discriminated-unions",
@@ -1631,51 +2184,51 @@
   ],
   "key_features": [
     {
-      "icon": "expressive",
       "title": "Expressive",
-      "content": "F# code is very expressive, requiring little code for great results"
+      "content": "F# code is very expressive, requiring little code for great results",
+      "icon": "expressive"
     },
     {
-      "icon": "fun",
       "title": "Fun",
-      "content": "F#'s powerful type system is a joy to work with"
+      "content": "F#'s powerful type system is a joy to work with",
+      "icon": "fun"
     },
     {
-      "icon": "safe",
       "title": "Safe",
-      "content": "F#'s type system helps catch errors at compile-time. No more null-reference exceptions!"
+      "content": "F#'s type system helps catch errors at compile-time. No more null-reference exceptions!",
+      "icon": "safe"
     },
     {
-      "icon": "functional",
       "title": "Functional first",
-      "content": "F# is primarily a functional language, but also has great object-oriented support"
+      "content": "F# is primarily a functional language, but also has great object-oriented support",
+      "icon": "functional"
     },
     {
-      "icon": "interop",
       "title": "Interop",
-      "content": "As a member of the .NET ecosystem, F# enjoys full, two-way compatibility with C# code/libraries"
+      "content": "As a member of the .NET ecosystem, F# enjoys full, two-way compatibility with C# code/libraries",
+      "icon": "interop"
     },
     {
-      "icon": "tooling",
       "title": "Tooling",
-      "content": "F# has excellent tooling, with linting and refactoring options built-in"
+      "content": "F# has excellent tooling, with linting and refactoring options built-in",
+      "icon": "tooling"
     }
   ],
   "tags": [
-    "paradigm/functional",
+    "execution_mode/compiled",
     "paradigm/declarative",
+    "paradigm/functional",
     "paradigm/imperative",
     "paradigm/object_oriented",
-    "typing/static",
-    "typing/strong",
-    "execution_mode/compiled",
-    "platform/windows",
-    "platform/mac",
-    "platform/linux",
-    "platform/ios",
     "platform/android",
+    "platform/ios",
+    "platform/linux",
+    "platform/mac",
     "platform/web",
+    "platform/windows",
     "runtime/clr",
+    "typing/static",
+    "typing/strong",
     "used_for/artificial_intelligence",
     "used_for/backends",
     "used_for/cross_platform_development",
diff --git a/exercises/practice/accumulate/.meta/config.json b/exercises/practice/accumulate/.meta/config.json
index 1c5c677d3..6f41d1aca 100644
--- a/exercises/practice/accumulate/.meta/config.json
+++ b/exercises/practice/accumulate/.meta/config.json
@@ -28,5 +28,5 @@
   },
   "blurb": "Implement the `accumulate` operation, which, given a collection and an operation to perform on each element of the collection, returns a new collection containing the result of applying that operation to each element of the input collection.",
   "source": "Conversation with James Edward Gray II",
-  "source_url": "https://twitter.com/jeg2"
+  "source_url": "http://graysoftinc.com/"
 }
diff --git a/exercises/practice/acronym/.docs/instructions.md b/exercises/practice/acronym/.docs/instructions.md
index c62fc3e85..133bd2cbb 100644
--- a/exercises/practice/acronym/.docs/instructions.md
+++ b/exercises/practice/acronym/.docs/instructions.md
@@ -10,8 +10,8 @@ Punctuation is handled as follows: hyphens are word separators (like whitespace)
 
 For example:
 
-|Input|Output|
-|-|-|
-|As Soon As Possible|ASAP|
-|Liquid-crystal display|LCD|
-|Thank George It's Friday!|TGIF|
+| Input                     | Output |
+| ------------------------- | ------ |
+| As Soon As Possible       | ASAP   |
+| Liquid-crystal display    | LCD    |
+| Thank George It's Friday! | TGIF   |
diff --git a/exercises/practice/affine-cipher/.docs/instructions.md b/exercises/practice/affine-cipher/.docs/instructions.md
index 2ad6d1521..26ce15342 100644
--- a/exercises/practice/affine-cipher/.docs/instructions.md
+++ b/exercises/practice/affine-cipher/.docs/instructions.md
@@ -6,7 +6,7 @@ The affine cipher is a type of monoalphabetic substitution cipher.
 Each character is mapped to its numeric equivalent, encrypted with a mathematical function and then converted to the letter relating to its new numeric value.
 Although all monoalphabetic ciphers are weak, the affine cipher is much stronger than the atbash cipher, because it has many more keys.
 
-[//]: # ( monoalphabetic as spelled by Merriam-Webster, compare to polyalphabetic )
+[//]: # " monoalphabetic as spelled by Merriam-Webster, compare to polyalphabetic "
 
 ## Encryption
 
@@ -23,7 +23,7 @@ Where:
   For the Roman alphabet `m` is `26`.
 - `a` and `b` are integers which make the encryption key
 
-Values `a` and `m` must be *coprime* (or, *relatively prime*) for automatic decryption to succeed, i.e., they have number `1` as their only common factor (more information can be found in the [Wikipedia article about coprime integers][coprime-integers]).
+Values `a` and `m` must be _coprime_ (or, _relatively prime_) for automatic decryption to succeed, i.e., they have number `1` as their only common factor (more information can be found in the [Wikipedia article about coprime integers][coprime-integers]).
 In case `a` is not coprime to `m`, your program should indicate that this is an error.
 Otherwise it should encrypt or decrypt with the provided key.
 
diff --git a/exercises/practice/all-your-base/.docs/instructions.md b/exercises/practice/all-your-base/.docs/instructions.md
index d5a2cde65..4602b5cfa 100644
--- a/exercises/practice/all-your-base/.docs/instructions.md
+++ b/exercises/practice/all-your-base/.docs/instructions.md
@@ -14,20 +14,20 @@ Given a number in base **a**, represented as a sequence of digits, convert it to
 
 In positional notation, a number in base **b** can be understood as a linear combination of powers of **b**.
 
-The number 42, *in base 10*, means:
+The number 42, _in base 10_, means:
 
 `(4 * 10^1) + (2 * 10^0)`
 
-The number 101010, *in base 2*, means:
+The number 101010, _in base 2_, means:
 
 `(1 * 2^5) + (0 * 2^4) + (1 * 2^3) + (0 * 2^2) + (1 * 2^1) + (0 * 2^0)`
 
-The number 1120, *in base 3*, means:
+The number 1120, _in base 3_, means:
 
 `(1 * 3^3) + (1 * 3^2) + (2 * 3^1) + (0 * 3^0)`
 
 I think you got the idea!
 
-*Yes. Those three numbers above are exactly the same. Congratulations!*
+_Yes. Those three numbers above are exactly the same. Congratulations!_
 
 [positional-notation]: https://en.wikipedia.org/wiki/Positional_notation
diff --git a/exercises/practice/allergies/.docs/instructions.md b/exercises/practice/allergies/.docs/instructions.md
index a13949209..daf8cfde2 100644
--- a/exercises/practice/allergies/.docs/instructions.md
+++ b/exercises/practice/allergies/.docs/instructions.md
@@ -22,6 +22,6 @@ 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.).
+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.
diff --git a/exercises/practice/armstrong-numbers/.docs/instructions.md b/exercises/practice/armstrong-numbers/.docs/instructions.md
index 744cfbe7f..5e56bbe46 100644
--- a/exercises/practice/armstrong-numbers/.docs/instructions.md
+++ b/exercises/practice/armstrong-numbers/.docs/instructions.md
@@ -5,9 +5,9 @@ An [Armstrong number][armstrong-number] is a number that is the sum of its own d
 For example:
 
 - 9 is an Armstrong number, because `9 = 9^1 = 9`
-- 10 is *not* an Armstrong number, because `10 != 1^2 + 0^2 = 1`
+- 10 is _not_ an Armstrong number, because `10 != 1^2 + 0^2 = 1`
 - 153 is an Armstrong number, because: `153 = 1^3 + 5^3 + 3^3 = 1 + 125 + 27 = 153`
-- 154 is *not* an Armstrong number, because: `154 != 1^3 + 5^3 + 4^3 = 1 + 125 + 64 = 190`
+- 154 is _not_ an Armstrong number, because: `154 != 1^3 + 5^3 + 4^3 = 1 + 125 + 64 = 190`
 
 Write some code to determine whether a number is an Armstrong number.
 
diff --git a/exercises/practice/binary-search-tree/.meta/config.json b/exercises/practice/binary-search-tree/.meta/config.json
index fcb7a1bd3..381620757 100644
--- a/exercises/practice/binary-search-tree/.meta/config.json
+++ b/exercises/practice/binary-search-tree/.meta/config.json
@@ -25,6 +25,5 @@
     ]
   },
   "blurb": "Insert and search for numbers in a binary tree.",
-  "source": "Josh Cheek",
-  "source_url": "https://twitter.com/josh_cheek"
+  "source": "Josh Cheek"
 }
diff --git a/exercises/practice/binary-search/.docs/instructions.md b/exercises/practice/binary-search/.docs/instructions.md
index aa1946cfb..12f4358eb 100644
--- a/exercises/practice/binary-search/.docs/instructions.md
+++ b/exercises/practice/binary-search/.docs/instructions.md
@@ -11,7 +11,7 @@ Binary search only works when a list has been sorted.
 
 The algorithm looks like this:
 
-- Find the middle element of a *sorted* list and compare it with the item we're looking for.
+- Find the middle element of a _sorted_ list and compare it with the item we're looking for.
 - If the middle element is our item, then we're done!
 - If the middle element is greater than our item, we can eliminate that element and all the elements **after** it.
 - If the middle element is less than our item, we can eliminate that element and all the elements **before** it.
diff --git a/exercises/practice/book-store/.docs/instructions.md b/exercises/practice/book-store/.docs/instructions.md
index 906eb5876..54403f17b 100644
--- a/exercises/practice/book-store/.docs/instructions.md
+++ b/exercises/practice/book-store/.docs/instructions.md
@@ -36,8 +36,8 @@ This would give a total of:
 
 Resulting in:
 
-- 5 × (100% - 25%) * $8 = 5 × $6.00 = $30.00, plus
-- 3 × (100% - 10%) * $8 = 3 × $7.20 = $21.60
+- 5 × (100% - 25%) × $8 = 5 × $6.00 = $30.00, plus
+- 3 × (100% - 10%) × $8 = 3 × $7.20 = $21.60
 
 Which equals $51.60.
 
@@ -53,8 +53,8 @@ This would give a total of:
 
 Resulting in:
 
-- 4 × (100% - 20%) * $8 = 4 × $6.40 = $25.60, plus
-- 4 × (100% - 20%) * $8 = 4 × $6.40 = $25.60
+- 4 × (100% - 20%) × $8 = 4 × $6.40 = $25.60, plus
+- 4 × (100% - 20%) × $8 = 4 × $6.40 = $25.60
 
 Which equals $51.20.
 
diff --git a/exercises/practice/bowling/.docs/instructions.md b/exercises/practice/bowling/.docs/instructions.md
index ddce7ee48..60ccad1b6 100644
--- a/exercises/practice/bowling/.docs/instructions.md
+++ b/exercises/practice/bowling/.docs/instructions.md
@@ -23,9 +23,9 @@ There are three cases for the tabulation of a frame.
 
 Here is a three frame example:
 
-| Frame 1         | Frame 2       | Frame 3                |
-| :-------------: |:-------------:| :---------------------:|
-| X (strike)      | 5/ (spare)    | 9 0 (open frame)       |
+|  Frame 1   |  Frame 2   |     Frame 3      |
+| :--------: | :--------: | :--------------: |
+| X (strike) | 5/ (spare) | 9 0 (open frame) |
 
 Frame 1 is (10 + 5 + 5) = 20
 
diff --git a/exercises/practice/circular-buffer/.docs/instructions.md b/exercises/practice/circular-buffer/.docs/instructions.md
index 3487a0f61..2ba1fda2a 100644
--- a/exercises/practice/circular-buffer/.docs/instructions.md
+++ b/exercises/practice/circular-buffer/.docs/instructions.md
@@ -4,39 +4,55 @@ A circular buffer, cyclic buffer or ring buffer is a data structure that uses a
 
 A circular buffer first starts empty and of some predefined length.
 For example, this is a 7-element buffer:
-<!-- prettier-ignore -->
-    [ ][ ][ ][ ][ ][ ][ ]
+
+```text
+[ ][ ][ ][ ][ ][ ][ ]
+```
 
 Assume that a 1 is written into the middle of the buffer (exact starting location does not matter in a circular buffer):
-<!-- prettier-ignore -->
-    [ ][ ][ ][1][ ][ ][ ]
+
+```text
+[ ][ ][ ][1][ ][ ][ ]
+```
 
 Then assume that two more elements are added — 2 & 3 — which get appended after the 1:
-<!-- prettier-ignore -->
-    [ ][ ][ ][1][2][3][ ]
+
+```text
+[ ][ ][ ][1][2][3][ ]
+```
 
 If two elements are then removed from the buffer, the oldest values inside the buffer are removed.
 The two elements removed, in this case, are 1 & 2, leaving the buffer with just a 3:
-<!-- prettier-ignore -->
-    [ ][ ][ ][ ][ ][3][ ]
+
+```text
+[ ][ ][ ][ ][ ][3][ ]
+```
 
 If the buffer has 7 elements then it is completely full:
-<!-- prettier-ignore -->
-    [5][6][7][8][9][3][4]
+
+```text
+[5][6][7][8][9][3][4]
+```
 
 When the buffer is full an error will be raised, alerting the client that further writes are blocked until a slot becomes free.
 
 When the buffer is full, the client can opt to overwrite the oldest data with a forced write.
 In this case, two more elements — A & B — are added and they overwrite the 3 & 4:
-<!-- prettier-ignore -->
-    [5][6][7][8][9][A][B]
+
+```text
+[5][6][7][8][9][A][B]
+```
 
 3 & 4 have been replaced by A & B making 5 now the oldest data in the buffer.
 Finally, if two elements are removed then what would be returned is 5 & 6 yielding the buffer:
-<!-- prettier-ignore -->
-    [ ][ ][7][8][9][A][B]
+
+```text
+[ ][ ][7][8][9][A][B]
+```
 
 Because there is space available, if the client again uses overwrite to store C & D then the space where 5 & 6 were stored previously will be used not the location of 7 & 8.
 7 is still the oldest element and the buffer is once again full.
-<!-- prettier-ignore -->
-    [C][D][7][8][9][A][B]
+
+```text
+[C][D][7][8][9][A][B]
+```
diff --git a/exercises/practice/clock/.meta/config.json b/exercises/practice/clock/.meta/config.json
index 6a29e0de7..fd30e3492 100644
--- a/exercises/practice/clock/.meta/config.json
+++ b/exercises/practice/clock/.meta/config.json
@@ -26,6 +26,5 @@
     ]
   },
   "blurb": "Implement a clock that handles times without dates.",
-  "source": "Pairing session with Erin Drummond",
-  "source_url": "https://twitter.com/ebdrummond"
+  "source": "Pairing session with Erin Drummond"
 }
diff --git a/exercises/practice/dot-dsl/.docs/instructions.md b/exercises/practice/dot-dsl/.docs/instructions.md
index 9230547ea..b3a63996d 100644
--- a/exercises/practice/dot-dsl/.docs/instructions.md
+++ b/exercises/practice/dot-dsl/.docs/instructions.md
@@ -1,7 +1,7 @@
 # Instructions
 
 A [Domain Specific Language (DSL)][dsl] is a small language optimized for a specific domain.
-Since a DSL is targeted, it can greatly impact productivity/understanding by allowing the writer to declare *what* they want rather than *how*.
+Since a DSL is targeted, it can greatly impact productivity/understanding by allowing the writer to declare _what_ they want rather than _how_.
 
 One problem area where they are applied are complex customizations/configurations.
 
diff --git a/exercises/practice/hello-world/.meta/config.json b/exercises/practice/hello-world/.meta/config.json
index d4b7b739c..1e787fc61 100644
--- a/exercises/practice/hello-world/.meta/config.json
+++ b/exercises/practice/hello-world/.meta/config.json
@@ -25,7 +25,7 @@
   "representer": {
     "version": 2
   },
-  "blurb": "The classical introductory exercise. Just say \"Hello, World!\".",
+  "blurb": "Exercism's classic introductory exercise. Just say \"Hello, World!\".",
   "source": "This is an exercise to introduce users to using Exercism",
   "source_url": "https://en.wikipedia.org/wiki/%22Hello,_world!%22_program"
 }
diff --git a/exercises/practice/isogram/.docs/instructions.md b/exercises/practice/isogram/.docs/instructions.md
index 5e4884476..2e8df851a 100644
--- a/exercises/practice/isogram/.docs/instructions.md
+++ b/exercises/practice/isogram/.docs/instructions.md
@@ -11,4 +11,4 @@ Examples of isograms:
 - downstream
 - six-year-old
 
-The word *isograms*, however, is not an isogram, because the s repeats.
+The word _isograms_, however, is not an isogram, because the s repeats.
diff --git a/exercises/practice/leap/.docs/instructions.md b/exercises/practice/leap/.docs/instructions.md
index a83826b2e..b14f8565d 100644
--- a/exercises/practice/leap/.docs/instructions.md
+++ b/exercises/practice/leap/.docs/instructions.md
@@ -1,22 +1,3 @@
 # Instructions
 
-Given a year, report if it is a leap year.
-
-The tricky thing here is that a leap year in the Gregorian calendar occurs:
-
-```text
-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.
-
-## 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]: https://www.youtube.com/watch?v=xX96xng7sAE
+Your task is to determine whether a given year is a leap year.
diff --git a/exercises/practice/leap/.docs/introduction.md b/exercises/practice/leap/.docs/introduction.md
new file mode 100644
index 000000000..1cb8b14cc
--- /dev/null
+++ b/exercises/practice/leap/.docs/introduction.md
@@ -0,0 +1,16 @@
+# Introduction
+
+A leap year (in the Gregorian calendar) occurs:
+
+- In every year that is evenly divisible by 4
+- Unless the year is evenly divisible by 100, in which case it's only a leap year if the year is also evenly divisible by 400.
+
+Some examples:
+
+- 1997 was not a leap year as it's not divisible by 4.
+- 1900 was not a leap year as it's not divisible by 400
+- 2000 was a leap year!
+
+~~~~exercism/note
+For a delightful, four minute explanation of the whole phenomenon of leap years, check out [this youtube video](https://www.youtube.com/watch?v=xX96xng7sAE).
+~~~~
diff --git a/exercises/practice/leap/.meta/config.json b/exercises/practice/leap/.meta/config.json
index 05c37125a..ba46d6aa3 100644
--- a/exercises/practice/leap/.meta/config.json
+++ b/exercises/practice/leap/.meta/config.json
@@ -25,7 +25,7 @@
       "Leap.fsproj"
     ]
   },
-  "blurb": "Given a year, report if it is a leap year.",
+  "blurb": "Determine whether a given year is a leap year.",
   "source": "CodeRanch Cattle Drive, Assignment 3",
   "source_url": "https://coderanch.com/t/718816/Leap"
 }
diff --git a/exercises/practice/list-ops/.docs/instructions.md b/exercises/practice/list-ops/.docs/instructions.md
index ccfc2f8b2..ebc5dffed 100644
--- a/exercises/practice/list-ops/.docs/instructions.md
+++ b/exercises/practice/list-ops/.docs/instructions.md
@@ -7,13 +7,13 @@ Implement a series of basic list operations, without using existing functions.
 
 The precise number and names of the operations to be implemented will be track dependent to avoid conflicts with existing names, but the general operations you will implement include:
 
-- `append` (*given two lists, add all items in the second list to the end of the first list*);
-- `concatenate` (*given a series of lists, combine all items in all lists into one flattened list*);
-- `filter` (*given a predicate and a list, return the list of all items for which `predicate(item)` is True*);
-- `length` (*given a list, return the total number of items within it*);
-- `map` (*given a function and a list, return the list of the results of applying `function(item)` on all items*);
-- `foldl` (*given a function, a list, and initial accumulator, fold (reduce) each item into the accumulator from the left*);
-- `foldr` (*given a function, a list, and an initial accumulator, fold (reduce) each item into the accumulator from the right*);
-- `reverse` (*given a list, return a list with all the original items, but in reversed order*).
+- `append` (_given two lists, add all items in the second list to the end of the first list_);
+- `concatenate` (_given a series of lists, combine all items in all lists into one flattened list_);
+- `filter` (_given a predicate and a list, return the list of all items for which `predicate(item)` is True_);
+- `length` (_given a list, return the total number of items within it_);
+- `map` (_given a function and a list, return the list of the results of applying `function(item)` on all items_);
+- `foldl` (_given a function, a list, and initial accumulator, fold (reduce) each item into the accumulator from the left_);
+- `foldr` (_given a function, a list, and an initial accumulator, fold (reduce) each item into the accumulator from the right_);
+- `reverse` (_given a list, return a list with all the original items, but in reversed order_).
 
 Note, the ordering in which arguments are passed to the fold functions (`foldl`, `foldr`) is significant.
diff --git a/exercises/practice/meetup/.meta/config.json b/exercises/practice/meetup/.meta/config.json
index a8157b3cf..eee653a4a 100644
--- a/exercises/practice/meetup/.meta/config.json
+++ b/exercises/practice/meetup/.meta/config.json
@@ -25,5 +25,5 @@
   },
   "blurb": "Calculate the date of meetups.",
   "source": "Jeremy Hinegardner mentioned a Boulder meetup that happens on the Wednesteenth of every month",
-  "source_url": "https://twitter.com/copiousfreetime"
+  "source_url": "http://www.copiousfreetime.org/"
 }
diff --git a/exercises/practice/perfect-numbers/.docs/instructions.md b/exercises/practice/perfect-numbers/.docs/instructions.md
index 689a73c00..b2bc82ca3 100644
--- a/exercises/practice/perfect-numbers/.docs/instructions.md
+++ b/exercises/practice/perfect-numbers/.docs/instructions.md
@@ -2,22 +2,38 @@
 
 Determine if a number is perfect, abundant, or deficient based on Nicomachus' (60 - 120 CE) classification scheme for positive integers.
 
-The Greek mathematician [Nicomachus][nicomachus] devised a classification scheme for positive integers, identifying each as belonging uniquely to the categories of **perfect**, **abundant**, or **deficient** based on their [aliquot sum][aliquot-sum].
-The aliquot sum is defined as the sum of the factors of a number not including the number itself.
+The Greek mathematician [Nicomachus][nicomachus] devised a classification scheme for positive integers, identifying each as belonging uniquely to the categories of [perfect](#perfect), [abundant](#abundant), or [deficient](#deficient) based on their [aliquot sum][aliquot-sum].
+The _aliquot sum_ is defined as the sum of the factors of a number not including the number itself.
 For example, the aliquot sum of `15` is `1 + 3 + 5 = 9`.
 
-- **Perfect**: aliquot sum = number
-  - 6 is a perfect number because (1 + 2 + 3) = 6
-  - 28 is a perfect number because (1 + 2 + 4 + 7 + 14) = 28
-- **Abundant**: aliquot sum > number
-  - 12 is an abundant number because (1 + 2 + 3 + 4 + 6) = 16
-  - 24 is an abundant number because (1 + 2 + 3 + 4 + 6 + 8 + 12) = 36
-- **Deficient**: aliquot sum < number
-  - 8 is a deficient number because (1 + 2 + 4) = 7
-  - Prime numbers are deficient
-
-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**.
+## Perfect
+
+A number is perfect when it equals its aliquot sum.
+For example:
+
+- `6` is a perfect number because `1 + 2 + 3 = 6`
+- `28` is a perfect number because `1 + 2 + 4 + 7 + 14 = 28`
+
+## Abundant
+
+A number is abundant when it is less than its aliquot sum.
+For example:
+
+- `12` is an abundant number because `1 + 2 + 3 + 4 + 6 = 16`
+- `24` is an abundant number because `1 + 2 + 3 + 4 + 6 + 8 + 12 = 36`
+
+## Deficient
+
+A number is deficient when it is greater than its aliquot sum.
+For example:
+
+- `8` is a deficient number because `1 + 2 + 4 = 7`
+- Prime numbers are deficient
+
+## Task
+
+Implement a way to determine whether a given number is [perfect](#perfect).
+Depending on your language track, you may also need to implement a way to determine whether a given number is [abundant](#abundant) or [deficient](#deficient).
 
 [nicomachus]: https://en.wikipedia.org/wiki/Nicomachus
 [aliquot-sum]: https://en.wikipedia.org/wiki/Aliquot_sum
diff --git a/exercises/practice/phone-number/.docs/instructions.md b/exercises/practice/phone-number/.docs/instructions.md
index 6d3275cdf..62ba48e96 100644
--- a/exercises/practice/phone-number/.docs/instructions.md
+++ b/exercises/practice/phone-number/.docs/instructions.md
@@ -5,18 +5,20 @@ Clean up user-entered phone numbers so that they can be sent SMS messages.
 The **North American Numbering Plan (NANP)** is a telephone numbering system used by many countries in North America like the United States, Canada or Bermuda.
 All NANP-countries share the same international country code: `1`.
 
-NANP numbers are ten-digit numbers consisting of a three-digit Numbering Plan Area code, commonly known as *area code*, followed by a seven-digit local number.
-The first three digits of the local number represent the *exchange code*, followed by the unique four-digit number which is the *subscriber number*.
+NANP numbers are ten-digit numbers consisting of a three-digit Numbering Plan Area code, commonly known as _area code_, followed by a seven-digit local number.
+The first three digits of the local number represent the _exchange code_, followed by the unique four-digit number which is the _subscriber number_.
 
 The format is usually represented as
 
 ```text
-(NXX)-NXX-XXXX
+NXX NXX-XXXX
 ```
 
 where `N` is any digit from 2 through 9 and `X` is any digit from 0 through 9.
 
-Your task is to clean up differently formatted telephone numbers by removing punctuation and the country code (1) if present.
+Sometimes they also have the country code (represented as `1` or `+1`) prefixed.
+
+Your task is to clean up differently formatted telephone numbers by removing punctuation and the country code if present.
 
 For example, the inputs
 
diff --git a/exercises/practice/protein-translation/.docs/instructions.md b/exercises/practice/protein-translation/.docs/instructions.md
index d9b9054cf..7dc34d2ed 100644
--- a/exercises/practice/protein-translation/.docs/instructions.md
+++ b/exercises/practice/protein-translation/.docs/instructions.md
@@ -29,16 +29,16 @@ Note the stop codon `"UAA"` terminates the translation and the final methionine
 
 Below are the codons and resulting Amino Acids needed for the exercise.
 
-Codon                 | Protein
-:---                  | :---
-AUG                   | Methionine
-UUU, UUC              | Phenylalanine
-UUA, UUG              | Leucine
-UCU, UCC, UCA, UCG    | Serine
-UAU, UAC              | Tyrosine
-UGU, UGC              | Cysteine
-UGG                   | Tryptophan
-UAA, UAG, UGA         | STOP
+| Codon              | Protein       |
+| :----------------- | :------------ |
+| AUG                | Methionine    |
+| UUU, UUC           | Phenylalanine |
+| UUA, UUG           | Leucine       |
+| UCU, UCC, UCA, UCG | Serine        |
+| UAU, UAC           | Tyrosine      |
+| UGU, UGC           | Cysteine      |
+| UGG                | Tryptophan    |
+| UAA, UAG, UGA      | STOP          |
 
 Learn more about [protein translation on Wikipedia][protein-translation].
 
diff --git a/exercises/practice/pythagorean-triplet/.meta/config.json b/exercises/practice/pythagorean-triplet/.meta/config.json
index 5ba48baa7..0deae139f 100644
--- a/exercises/practice/pythagorean-triplet/.meta/config.json
+++ b/exercises/practice/pythagorean-triplet/.meta/config.json
@@ -25,7 +25,7 @@
       "PythagoreanTriplet.fsproj"
     ]
   },
-  "blurb": "There exists exactly one Pythagorean triplet for which a + b + c = 1000. Find the product a * b * c.",
+  "blurb": "There exists exactly one Pythagorean triplet for which a + b + c = 1000. Find the triplet.",
   "source": "Problem 9 at Project Euler",
   "source_url": "https://projecteuler.net/problem=9"
 }
diff --git a/exercises/practice/queen-attack/.docs/instructions.md b/exercises/practice/queen-attack/.docs/instructions.md
index ad7ea9547..97f22a0ae 100644
--- a/exercises/practice/queen-attack/.docs/instructions.md
+++ b/exercises/practice/queen-attack/.docs/instructions.md
@@ -8,18 +8,14 @@ A chessboard can be represented by an 8 by 8 array.
 
 So if you are told the white queen is at `c5` (zero-indexed at column 2, row 3) and the black queen at `f2` (zero-indexed at column 5, row 6), then you know that the set-up is like so:
 
-```text
-  a b c d e f g h
-8 _ _ _ _ _ _ _ _ 8
-7 _ _ _ _ _ _ _ _ 7
-6 _ _ _ _ _ _ _ _ 6
-5 _ _ W _ _ _ _ _ 5
-4 _ _ _ _ _ _ _ _ 4
-3 _ _ _ _ _ _ _ _ 3
-2 _ _ _ _ _ B _ _ 2
-1 _ _ _ _ _ _ _ _ 1
-  a b c d e f g h
-```
+![A chess board with two queens. Arrows emanating from the queen at c5 indicate possible directions of capture along file, rank and diagonal.](https://assets.exercism.org/images/exercises/queen-attack/queen-capture.svg)
 
 You are also able to answer whether the queens can attack each other.
 In this case, that answer would be yes, they can, because both pieces share a diagonal.
+
+## Credit
+
+The chessboard image was made by [habere-et-dispertire][habere-et-dispertire] using LaTeX and the [chessboard package][chessboard-package] by Ulrike Fischer.
+
+[habere-et-dispertire]: https://exercism.org/profiles/habere-et-dispertire
+[chessboard-package]: https://github.com/u-fischer/chessboard
diff --git a/exercises/practice/rest-api/.docs/instructions.md b/exercises/practice/rest-api/.docs/instructions.md
index f3b226a73..af223ba4b 100644
--- a/exercises/practice/rest-api/.docs/instructions.md
+++ b/exercises/practice/rest-api/.docs/instructions.md
@@ -20,7 +20,7 @@ Your task is to implement a simple [RESTful API][restful-wikipedia] that receive
   },
   "owed_by": {
     "Bob": 6.5,
-    "Dan": 2.75,
+    "Dan": 2.75
   },
   "balance": "<(total owed by other users) - (total owed to other users)>"
 }
@@ -28,11 +28,11 @@ Your task is to implement a simple [RESTful API][restful-wikipedia] that receive
 
 ### Methods
 
-| Description | HTTP Method | URL | Payload Format | Response w/o Payload | Response w/ Payload |
-| --- | --- | --- | --- | --- | --- |
-| List of user information | GET | /users | `{"users":["Adam","Bob"]}` | `{"users":<List of all User objects>}` | `{"users":<List of User objects for <users> (sorted by name)}` |
-| Create user | POST | /add | `{"user":<name of new user (unique)>}` | N/A | `<User object for new user>` |
-| Create IOU | POST | /iou | `{"lender":<name of lender>,"borrower":<name of borrower>,"amount":5.25}` | N/A | `{"users":<updated User objects for <lender> and <borrower> (sorted by name)>}` |
+| Description              | HTTP Method | URL    | Payload Format                                                            | Response w/o Payload                   | Response w/ Payload                                                             |
+| ------------------------ | ----------- | ------ | ------------------------------------------------------------------------- | -------------------------------------- | ------------------------------------------------------------------------------- |
+| List of user information | GET         | /users | `{"users":["Adam","Bob"]}`                                                | `{"users":<List of all User objects>}` | `{"users":<List of User objects for <users> (sorted by name)}`                  |
+| Create user              | POST        | /add   | `{"user":<name of new user (unique)>}`                                    | N/A                                    | `<User object for new user>`                                                    |
+| Create IOU               | POST        | /iou   | `{"lender":<name of lender>,"borrower":<name of borrower>,"amount":5.25}` | N/A                                    | `{"users":<updated User objects for <lender> and <borrower> (sorted by name)>}` |
 
 ## Other Resources
 
@@ -44,5 +44,5 @@ Your task is to implement a simple [RESTful API][restful-wikipedia] that receive
 [restful-wikipedia]: https://en.wikipedia.org/wiki/Representational_state_transfer
 [iou]: https://en.wikipedia.org/wiki/IOU
 [github-rest]: https://developer.github.com/v3/
-[reddit-rest]: https://www.reddit.com/dev/api/
+[reddit-rest]: https://web.archive.org/web/20231202231149/https://www.reddit.com/dev/api/
 [restfulapi]: https://restfulapi.net/
diff --git a/exercises/practice/rotational-cipher/.docs/instructions.md b/exercises/practice/rotational-cipher/.docs/instructions.md
index 4dee51b35..4bf64ca1d 100644
--- a/exercises/practice/rotational-cipher/.docs/instructions.md
+++ b/exercises/practice/rotational-cipher/.docs/instructions.md
@@ -22,8 +22,8 @@ Ciphertext is written out in the same formatting as the input including spaces a
 
 ## Examples
 
-- ROT5  `omg` gives `trl`
-- ROT0  `c` gives `c`
+- 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.`
diff --git a/exercises/practice/scale-generator/.docs/instructions.md b/exercises/practice/scale-generator/.docs/instructions.md
index 23e06e1ab..ebb7debc7 100644
--- a/exercises/practice/scale-generator/.docs/instructions.md
+++ b/exercises/practice/scale-generator/.docs/instructions.md
@@ -56,13 +56,13 @@ Then, for each interval in the pattern, the next note is determined by starting
 
 For example, starting with G and using the seven intervals MMmMMMm, there would be the following eight notes:
 
-Note | Reason
---|--
-G | Tonic
-A | M indicates a whole step from G, skipping G♯
-B | M indicates a whole step from A, skipping A♯
-C | m indicates a half step from B, skipping nothing
-D | M indicates a whole step from C, skipping C♯
-E | M indicates a whole step from D, skipping D♯
-F♯ | M indicates a whole step from E, skipping F
-G | m indicates a half step from F♯, skipping nothing
+| Note | Reason                                            |
+| ---- | ------------------------------------------------- |
+| G    | Tonic                                             |
+| A    | M indicates a whole step from G, skipping G♯      |
+| B    | M indicates a whole step from A, skipping A♯      |
+| C    | m indicates a half step from B, skipping nothing  |
+| D    | M indicates a whole step from C, skipping C♯      |
+| E    | M indicates a whole step from D, skipping D♯      |
+| F♯   | M indicates a whole step from E, skipping F       |
+| G    | m indicates a half step from F♯, skipping nothing |
diff --git a/exercises/practice/series/.docs/instructions.md b/exercises/practice/series/.docs/instructions.md
index e32cc38c6..fd97a6706 100644
--- a/exercises/practice/series/.docs/instructions.md
+++ b/exercises/practice/series/.docs/instructions.md
@@ -15,5 +15,5 @@ And the following 4-digit series:
 
 And if you ask for a 6-digit series from a 5-digit string, you deserve whatever you get.
 
-Note that these series are only required to occupy *adjacent positions* in the input;
-the digits need not be *numerically consecutive*.
+Note that these series are only required to occupy _adjacent positions_ in the input;
+the digits need not be _numerically consecutive_.
diff --git a/exercises/practice/sgf-parsing/.docs/instructions.md b/exercises/practice/sgf-parsing/.docs/instructions.md
index d38b341fc..edc8d6b18 100644
--- a/exercises/practice/sgf-parsing/.docs/instructions.md
+++ b/exercises/practice/sgf-parsing/.docs/instructions.md
@@ -24,7 +24,7 @@ This is a tree with three nodes:
   "SZ", value = "19"). (FF indicates the version of SGF, C is a
   comment and SZ is the size of the board.)
   - The top level node has a single child which has a single property:
-    B\[aa\].  (Black plays on the point encoded as "aa", which is the
+    B\[aa\]. (Black plays on the point encoded as "aa", which is the
     1-1 point).
     - The B\[aa\] node has a single child which has a single property:
       W\[ab\].
diff --git a/exercises/practice/spiral-matrix/.meta/config.json b/exercises/practice/spiral-matrix/.meta/config.json
index 34247556a..f1f9b917f 100644
--- a/exercises/practice/spiral-matrix/.meta/config.json
+++ b/exercises/practice/spiral-matrix/.meta/config.json
@@ -25,5 +25,5 @@
   },
   "blurb": "Given the size, return a square matrix of numbers in spiral order.",
   "source": "Reddit r/dailyprogrammer challenge #320 [Easy] Spiral Ascension.",
-  "source_url": "https://www.reddit.com/r/dailyprogrammer/comments/6i60lr/20170619_challenge_320_easy_spiral_ascension/"
+  "source_url": "https://web.archive.org/web/20230607064729/https://old.reddit.com/r/dailyprogrammer/comments/6i60lr/20170619_challenge_320_easy_spiral_ascension/"
 }
diff --git a/exercises/practice/strain/.meta/config.json b/exercises/practice/strain/.meta/config.json
index 8fe3dabc1..a18b062b5 100644
--- a/exercises/practice/strain/.meta/config.json
+++ b/exercises/practice/strain/.meta/config.json
@@ -25,5 +25,5 @@
   },
   "blurb": "Implement the `keep` and `discard` operation on collections. Given a collection and a predicate on the collection's elements, `keep` returns a new collection containing those elements where the predicate is true, while `discard` returns a new collection containing those elements where the predicate is false.",
   "source": "Conversation with James Edward Gray II",
-  "source_url": "https://twitter.com/jeg2"
+  "source_url": "http://graysoftinc.com/"
 }
diff --git a/exercises/practice/transpose/.meta/config.json b/exercises/practice/transpose/.meta/config.json
index 1f8a7649c..6bd0cde27 100644
--- a/exercises/practice/transpose/.meta/config.json
+++ b/exercises/practice/transpose/.meta/config.json
@@ -25,5 +25,5 @@
   },
   "blurb": "Take input text and output it transposed.",
   "source": "Reddit r/dailyprogrammer challenge #270 [Easy].",
-  "source_url": "https://www.reddit.com/r/dailyprogrammer/comments/4msu2x/challenge_270_easy_transpose_the_input_text"
+  "source_url": "https://web.archive.org/web/20230630051421/https://old.reddit.com/r/dailyprogrammer/comments/4msu2x/challenge_270_easy_transpose_the_input_text/"
 }
diff --git a/exercises/practice/wordy/.docs/instructions.md b/exercises/practice/wordy/.docs/instructions.md
index 0b9e67b6c..aafb9ee54 100644
--- a/exercises/practice/wordy/.docs/instructions.md
+++ b/exercises/practice/wordy/.docs/instructions.md
@@ -48,7 +48,7 @@ Since these are verbal word problems, evaluate the expression from left-to-right
 
 > What is 3 plus 2 multiplied by 3?
 
-15  (i.e. not 9)
+15 (i.e. not 9)
 
 ## Iteration 4 — Errors
 
diff --git a/exercises/practice/yacht/.docs/instructions.md b/exercises/practice/yacht/.docs/instructions.md
index 163ba3792..54fdb452f 100644
--- a/exercises/practice/yacht/.docs/instructions.md
+++ b/exercises/practice/yacht/.docs/instructions.md
@@ -6,24 +6,24 @@ The score of a throw of the dice depends on category chosen.
 
 ## Scores in Yacht
 
-| Category | Score | Description | Example |
-| -------- | ----- | ----------- | ------- |
-| Ones | 1 × number of ones | Any combination | 1 1 1 4 5 scores 3 |
-| Twos | 2 × number of twos | Any combination | 2 2 3 4 5 scores 4 |
-| Threes | 3 × number of threes | Any combination | 3 3 3 3 3 scores 15 |
-| Fours | 4 × number of fours | Any combination | 1 2 3 3 5 scores 0 |
-| Fives | 5 × number of fives| Any combination | 5 1 5 2 5 scores 15 |
-| Sixes | 6 × number of sixes | Any combination | 2 3 4 5 6 scores 6 |
-| Full House | Total of the dice | Three of one number and two of another | 3 3 3 5 5 scores 19 |
-| Four of a Kind | Total of the four dice | At least four dice showing the same face | 4 4 4 4 6 scores 16 |
-| Little Straight |  30 points | 1-2-3-4-5 | 1 2 3 4 5 scores 30 |
-| Big Straight | 30 points | 2-3-4-5-6 | 2 3 4 5 6 scores 30 |
-| Choice | Sum of the dice | Any combination | 2 3 3 4 6 scores 18 |
-| Yacht | 50 points | All five dice showing the same face | 4 4 4 4 4 scores 50 |
+| Category        | Score                  | Description                              | Example             |
+| --------------- | ---------------------- | ---------------------------------------- | ------------------- |
+| Ones            | 1 × number of ones     | Any combination                          | 1 1 1 4 5 scores 3  |
+| Twos            | 2 × number of twos     | Any combination                          | 2 2 3 4 5 scores 4  |
+| Threes          | 3 × number of threes   | Any combination                          | 3 3 3 3 3 scores 15 |
+| Fours           | 4 × number of fours    | Any combination                          | 1 2 3 3 5 scores 0  |
+| Fives           | 5 × number of fives    | Any combination                          | 5 1 5 2 5 scores 15 |
+| Sixes           | 6 × number of sixes    | Any combination                          | 2 3 4 5 6 scores 6  |
+| Full House      | Total of the dice      | Three of one number and two of another   | 3 3 3 5 5 scores 19 |
+| Four of a Kind  | Total of the four dice | At least four dice showing the same face | 4 4 4 4 6 scores 16 |
+| Little Straight | 30 points              | 1-2-3-4-5                                | 1 2 3 4 5 scores 30 |
+| Big Straight    | 30 points              | 2-3-4-5-6                                | 2 3 4 5 6 scores 30 |
+| Choice          | Sum of the dice        | Any combination                          | 2 3 3 4 6 scores 18 |
+| Yacht           | 50 points              | All five dice showing the same face      | 4 4 4 4 4 scores 50 |
 
 If the dice do not satisfy the requirements of a category, the score is zero.
-If, for example, *Four Of A Kind* is entered in the *Yacht* category, zero points are scored.
-A *Yacht* scores zero if entered in the *Full House* category.
+If, for example, _Four Of A Kind_ is entered in the _Yacht_ category, zero points are scored.
+A _Yacht_ scores zero if entered in the _Full House_ category.
 
 ## Task