Run configlet sync and unbreak JSON file formats

config.json

@@ -1455,13 +1455,8 @@
         "slug": "tournament",
         "name": "Tournament",
         "uuid": "f4634d37-2357-4b54-8cd8-ad450234537a",
-        "practices": [
-          "string-formatting"
-        ],
-        "prerequisites": [
-          "strings",
-          "string-formatting"
-        ],
+        "practices": [],
+        "prerequisites": [],
         "difficulty": 6
       },
       {

exercises/concept/lasagna/.meta/config.json

@@ -1,5 +1,7 @@
 {
-  "authors": ["SleeplessByte"],
+  "authors": [
+    "SleeplessByte"
+  ],
   "files": {
     "solution": [
       "lasagna.ts"

exercises/practice/acronym/.meta/config.json

@@ -17,14 +17,14 @@
     ]
   },
   "blurb": "Convert a long phrase to its acronym.",
+  "source": "Julien Vanier",
+  "source_url": "https://github.com/monkbroc",
   "custom": {
     "version.tests.compatibility": "jest-29",
     "flag.tests.task-per-describe": false,
     "flag.tests.may-run-long": false,
     "flag.tests.includes-optional": false,
     "flag.tests.jest": true,
     "flag.tests.tstyche": false
-  },
-  "source": "Julien Vanier",
-  "source_url": "https://github.com/monkbroc"
+  }
 }

exercises/practice/allergies/.meta/config.json

@@ -18,14 +18,14 @@
     ]
   },
   "blurb": "Given a person's allergy score, determine whether or not they're allergic to a given item, and their full list of allergies.",
+  "source": "Exercise by the JumpstartLab team for students at The Turing School of Software and Design.",
+  "source_url": "https://www.turing.edu/",
   "custom": {
     "version.tests.compatibility": "jest-29",
     "flag.tests.task-per-describe": false,
     "flag.tests.may-run-long": false,
     "flag.tests.includes-optional": false,
     "flag.tests.jest": true,
     "flag.tests.tstyche": false
-  },
-  "source": "Exercise by the JumpstartLab team for students at The Turing School of Software and Design.",
-  "source_url": "https://www.turing.edu/"
+  }
 }

exercises/practice/anagram/.meta/config.json

@@ -20,6 +20,8 @@
     ]
   },
   "blurb": "Find the words that use the same letters as another word.",
+  "source": "Inspired by the Extreme Startup game",
+  "source_url": "https://github.com/rchatley/extreme_startup",
   "custom": {
     "version.tests.compatibility": "jest-29",
     "flag.tests.task-per-describe": false,
@@ -28,6 +30,4 @@
     "flag.tests.jest": true,
     "flag.tests.tstyche": false
   }
-  "source": "Inspired by the Extreme Startup game",
-  "source_url": "https://github.com/rchatley/extreme_startup"
 }

exercises/practice/armstrong-numbers/.meta/config.json

@@ -18,14 +18,14 @@
     ]
   },
   "blurb": "Determine if a number is an Armstrong number.",
+  "source": "Wikipedia",
+  "source_url": "https://en.wikipedia.org/wiki/Narcissistic_number",
   "custom": {
     "version.tests.compatibility": "jest-29",
     "flag.tests.task-per-describe": false,
     "flag.tests.may-run-long": false,
     "flag.tests.includes-optional": false,
     "flag.tests.jest": true,
     "flag.tests.tstyche": false
-  },
-  "source": "Wikipedia",
-  "source_url": "https://en.wikipedia.org/wiki/Narcissistic_number"
+  }
 }

exercises/practice/atbash-cipher/.meta/config.json

@@ -19,14 +19,14 @@
     ]
   },
   "blurb": "Create an implementation of the Atbash cipher, an ancient encryption system created in the Middle East.",
+  "source": "Wikipedia",
+  "source_url": "https://en.wikipedia.org/wiki/Atbash",
   "custom": {
     "version.tests.compatibility": "jest-29",
     "flag.tests.task-per-describe": false,
     "flag.tests.may-run-long": false,
     "flag.tests.includes-optional": false,
     "flag.tests.jest": true,
     "flag.tests.tstyche": false
-  },
-  "source": "Wikipedia",
-  "source_url": "https://en.wikipedia.org/wiki/Atbash"
+  }
 }

exercises/practice/binary-search-tree/.meta/config.json

@@ -19,13 +19,13 @@
     ]
   },
   "blurb": "Insert and search for numbers in a binary tree.",
+  "source": "Josh Cheek",
   "custom": {
     "version.tests.compatibility": "jest-29",
     "flag.tests.task-per-describe": false,
     "flag.tests.may-run-long": false,
     "flag.tests.includes-optional": false,
     "flag.tests.jest": true,
     "flag.tests.tstyche": false
-  },
-  "source": "Josh Cheek"
+  }
 }

exercises/practice/binary-search/.meta/config.json

@@ -18,14 +18,14 @@
     ]
   },
   "blurb": "Implement a binary search algorithm.",
+  "source": "Wikipedia",
+  "source_url": "https://en.wikipedia.org/wiki/Binary_search_algorithm",
   "custom": {
     "version.tests.compatibility": "jest-29",
     "flag.tests.task-per-describe": false,
     "flag.tests.may-run-long": false,
     "flag.tests.includes-optional": false,
     "flag.tests.jest": true,
     "flag.tests.tstyche": false
-  },
-  "source": "Wikipedia",
-  "source_url": "https://en.wikipedia.org/wiki/Binary_search_algorithm"
+  }
 }

exercises/practice/bob/.meta/config.json

@@ -21,14 +21,14 @@
     ]
   },
   "blurb": "Bob is a lackadaisical teenager. In conversation, his responses are very limited.",
+  "source": "Inspired by the 'Deaf Grandma' exercise in Chris Pine's Learn to Program tutorial.",
+  "source_url": "https://pine.fm/LearnToProgram/chap_06.html",
   "custom": {
     "version.tests.compatibility": "jest-29",
     "flag.tests.task-per-describe": false,
     "flag.tests.may-run-long": false,
     "flag.tests.includes-optional": false,
     "flag.tests.jest": true,
     "flag.tests.tstyche": false
-  },
-  "source": "Inspired by the 'Deaf Grandma' exercise in Chris Pine's Learn to Program tutorial.",
-  "source_url": "https://pine.fm/LearnToProgram/chap_06.html"
+  }
 }

exercises/practice/bottle-song/.meta/config.json

@@ -1,20 +1,19 @@
 {
-    "authors": [
-      "Budmin"
+  "authors": [
+    "Budmin"
+  ],
+  "files": {
+    "solution": [
+      "bottle-song.ts"
     ],
-    "files": {
-      "solution": [
-        "bottle-song.ts"
-      ],
-      "test": [
-        "bottle-song.test.ts"
-      ],
-      "example": [
-        ".meta/proof.ci.ts"
-      ]
-    },
-    "blurb": "Produce the lyrics to the popular children's repetitive song: Ten Green Bottles.",
-    "source": "Wikipedia",
-    "source_url": "https://en.wikipedia.org/wiki/Ten_Green_Bottles"
-  }
-
+    "test": [
+      "bottle-song.test.ts"
+    ],
+    "example": [
+      ".meta/proof.ci.ts"
+    ]
+  },
+  "blurb": "Produce the lyrics to the popular children's repetitive song: Ten Green Bottles.",
+  "source": "Wikipedia",
+  "source_url": "https://en.wikipedia.org/wiki/Ten_Green_Bottles"
+}

exercises/practice/bowling/.meta/config.json

@@ -18,14 +18,14 @@
     ]
   },
   "blurb": "Score a bowling game.",
+  "source": "The Bowling Game Kata from UncleBob",
+  "source_url": "https://web.archive.org/web/20221001111000/http://butunclebob.com/ArticleS.UncleBob.TheBowlingGameKata",
   "custom": {
     "version.tests.compatibility": "jest-29",
     "flag.tests.task-per-describe": false,
     "flag.tests.may-run-long": false,
     "flag.tests.includes-optional": false,
     "flag.tests.jest": true,
     "flag.tests.tstyche": false
-  },
-  "source": "The Bowling Game Kata from UncleBob",
-  "source_url": "https://web.archive.org/web/20221001111000/http://butunclebob.com/ArticleS.UncleBob.TheBowlingGameKata"
+  }
 }

exercises/practice/change/.meta/config.json

@@ -14,14 +14,14 @@
     ]
   },
   "blurb": "Correctly determine change to be given using the least number of coins.",
+  "source": "Software Craftsmanship - Coin Change Kata",
+  "source_url": "https://web.archive.org/web/20130115115225/http://craftsmanship.sv.cmu.edu:80/exercises/coin-change-kata",
   "custom": {
     "version.tests.compatibility": "jest-29",
     "flag.tests.task-per-describe": false,
     "flag.tests.may-run-long": false,
     "flag.tests.includes-optional": false,
     "flag.tests.jest": true,
     "flag.tests.tstyche": false
-  },
-  "source": "Software Craftsmanship - Coin Change Kata",
-  "source_url": "https://web.archive.org/web/20130115115225/http://craftsmanship.sv.cmu.edu:80/exercises/coin-change-kata"
+  }
 }

exercises/practice/circular-buffer/.meta/config.json

@@ -18,14 +18,14 @@
     ]
   },
   "blurb": "A data structure that uses a single, fixed-size buffer as if it were connected end-to-end.",
+  "source": "Wikipedia",
+  "source_url": "https://en.wikipedia.org/wiki/Circular_buffer",
   "custom": {
     "version.tests.compatibility": "jest-29",
     "flag.tests.task-per-describe": false,
     "flag.tests.may-run-long": false,
     "flag.tests.includes-optional": false,
     "flag.tests.jest": true,
     "flag.tests.tstyche": false
-  },
-  "source": "Wikipedia",
-  "source_url": "https://en.wikipedia.org/wiki/Circular_buffer"
+  }
 }

exercises/practice/clock/.meta/config.json

@@ -18,13 +18,13 @@
     ]
   },
   "blurb": "Implement a clock that handles times without dates.",
+  "source": "Pairing session with Erin Drummond",
   "custom": {
     "version.tests.compatibility": "jest-29",
     "flag.tests.task-per-describe": false,
     "flag.tests.may-run-long": false,
     "flag.tests.includes-optional": false,
     "flag.tests.jest": true,
     "flag.tests.tstyche": false
-  },
-  "source": "Pairing session with Erin Drummond"
+  }
 }

exercises/practice/collatz-conjecture/.meta/config.json

@@ -18,14 +18,14 @@
     ]
   },
   "blurb": "Calculate the number of steps to reach 1 using the Collatz conjecture.",
+  "source": "Wikipedia",
+  "source_url": "https://en.wikipedia.org/wiki/Collatz_conjecture",
   "custom": {
     "version.tests.compatibility": "jest-29",
     "flag.tests.task-per-describe": false,
     "flag.tests.may-run-long": false,
     "flag.tests.includes-optional": false,
     "flag.tests.jest": true,
     "flag.tests.tstyche": false
-  },
-  "source": "Wikipedia",
-  "source_url": "https://en.wikipedia.org/wiki/Collatz_conjecture"
+  }
 }

exercises/practice/complex-numbers/.meta/config.json

@@ -18,14 +18,14 @@
     ]
   },
   "blurb": "Implement complex numbers.",
+  "source": "Wikipedia",
+  "source_url": "https://en.wikipedia.org/wiki/Complex_number",
   "custom": {
     "version.tests.compatibility": "jest-29",
     "flag.tests.task-per-describe": false,
     "flag.tests.may-run-long": false,
     "flag.tests.includes-optional": false,
     "flag.tests.jest": true,
     "flag.tests.tstyche": false
-  },
-  "source": "Wikipedia",
-  "source_url": "https://en.wikipedia.org/wiki/Complex_number"
+  }
 }

exercises/practice/crypto-square/.meta/config.json

@@ -18,14 +18,14 @@
     ]
   },
   "blurb": "Implement the classic method for composing secret messages called a square code.",
+  "source": "J Dalbey's Programming Practice problems",
+  "source_url": "https://users.csc.calpoly.edu/~jdalbey/103/Projects/ProgrammingPractice.html",
   "custom": {
     "version.tests.compatibility": "jest-29",
     "flag.tests.task-per-describe": false,
     "flag.tests.may-run-long": false,
     "flag.tests.includes-optional": true,
     "flag.tests.jest": true,
     "flag.tests.tstyche": false
-  },
-  "source": "J Dalbey's Programming Practice problems",
-  "source_url": "https://users.csc.calpoly.edu/~jdalbey/103/Projects/ProgrammingPractice.html"
+  }
 }

exercises/practice/darts/.meta/config.json

@@ -17,13 +17,13 @@
     ]
   },
   "blurb": "Calculate the points scored in a single toss of a Darts game.",
+  "source": "Inspired by an exercise created by a professor Della Paolera in Argentina",
   "custom": {
     "version.tests.compatibility": "jest-29",
     "flag.tests.task-per-describe": false,
     "flag.tests.may-run-long": false,
     "flag.tests.includes-optional": false,
     "flag.tests.jest": true,
     "flag.tests.tstyche": false
-  },
-  "source": "Inspired by an exercise created by a professor Della Paolera in Argentina"
+  }
 }

exercises/practice/diamond/.meta/config.json

@@ -18,14 +18,14 @@
     ]
   },
   "blurb": "Given a letter, print a diamond starting with 'A' with the supplied letter at the widest point.",
+  "source": "Seb Rose",
+  "source_url": "https://web.archive.org/web/20220807163751/http://claysnow.co.uk/recycling-tests-in-tdd/",
   "custom": {
     "version.tests.compatibility": "jest-29",
     "flag.tests.task-per-describe": false,
     "flag.tests.may-run-long": false,
     "flag.tests.includes-optional": false,
     "flag.tests.jest": true,
     "flag.tests.tstyche": false
-  },
-  "source": "Seb Rose",
-  "source_url": "https://web.archive.org/web/20220807163751/http://claysnow.co.uk/recycling-tests-in-tdd/"
+  }
 }

exercises/practice/difference-of-squares/.meta/config.json

@@ -17,14 +17,14 @@
     ]
   },
   "blurb": "Find the difference between the square of the sum and the sum of the squares of the first N natural numbers.",
+  "source": "Problem 6 at Project Euler",
+  "source_url": "https://projecteuler.net/problem=6",
   "custom": {
     "version.tests.compatibility": "jest-29",
     "flag.tests.task-per-describe": false,
     "flag.tests.may-run-long": false,
     "flag.tests.includes-optional": false,
     "flag.tests.jest": true,
     "flag.tests.tstyche": false
-  },
-  "source": "Problem 6 at Project Euler",
-  "source_url": "https://projecteuler.net/problem=6"
+  }
 }

exercises/practice/diffie-hellman/.meta/config.json

@@ -18,14 +18,14 @@
     ]
   },
   "blurb": "Diffie-Hellman key exchange.",
+  "source": "Wikipedia, 1024 bit key from www.cryptopp.com/wiki.",
+  "source_url": "https://en.wikipedia.org/wiki/Diffie%E2%80%93Hellman_key_exchange",
   "custom": {
     "version.tests.compatibility": "jest-29",
     "flag.tests.task-per-describe": false,
     "flag.tests.may-run-long": false,
     "flag.tests.includes-optional": false,
     "flag.tests.jest": true,
     "flag.tests.tstyche": false
-  },
-  "source": "Wikipedia, 1024 bit key from www.cryptopp.com/wiki.",
-  "source_url": "https://en.wikipedia.org/wiki/Diffie%E2%80%93Hellman_key_exchange"
+  }
 }