Configlet sync and format (#800)

exercises/concept/basics/.meta/config.json

@@ -1,11 +1,7 @@
 {
-  "blurb": "TODO: add blurb for basics exercise",
   "authors": [
     "stillleben"
   ],
-  "forked_from": [
-    "csharp/lucians-luscious-lasagna"
-  ],
   "files": {
     "solution": [
       "src/main/scala/Lasagna.scala"
@@ -19,5 +15,9 @@
     "invalidator": [
       "build.sbt"
     ]
-  }
+  },
+  "forked_from": [
+    "csharp/lucians-luscious-lasagna"
+  ],
+  "blurb": "TODO: add blurb for basics exercise"
 }

exercises/practice/accumulate/.meta/config.json

@@ -1,5 +1,4 @@
 {
-  "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.",
   "authors": [
     "ricemery"
   ],
@@ -23,6 +22,7 @@
       "build.sbt"
     ]
   },
+  "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": "http://graysoftinc.com/"
 }

exercises/practice/acronym/.approaches/config.json

@@ -1,22 +1,27 @@
 {
   "introduction": {
-    "authors": ["bobahop"],
-    "contributors": []
+    "authors": [
+      "bobahop"
+    ]
   },
   "approaches": [
     {
       "uuid": "83f3d79b-fc07-4160-87e5-e11e21d31ac2",
       "slug": "split",
       "title": "split",
       "blurb": "Use split to get the words.",
-      "authors": ["bobahop"]
+      "authors": [
+        "bobahop"
+      ]
     },
     {
       "uuid": "986e4b72-1a7a-4684-9dd1-280537d285c8",
       "slug": "findallin",
       "title": "findAllIn",
       "blurb": "Use findAllIn to get the words.",
-      "authors": ["bobahop"]
+      "authors": [
+        "bobahop"
+      ]
     }
   ]
 }

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

@@ -1,5 +1,4 @@
 {
-  "blurb": "Convert a long phrase to its acronym.",
   "authors": [
     "ricemery"
   ],
@@ -23,6 +22,7 @@
       "build.sbt"
     ]
   },
+  "blurb": "Convert a long phrase to its acronym.",
   "source": "Julien Vanier",
   "source_url": "https://github.com/monkbroc"
 }

exercises/practice/all-your-base/.meta/config.json

@@ -1,5 +1,4 @@
 {
-  "blurb": "Convert a number, represented as a sequence of digits in one base, to any other base.",
   "authors": [
     "ricemery"
   ],
@@ -22,5 +21,6 @@
     "invalidator": [
       "build.sbt"
     ]
-  }
+  },
+  "blurb": "Convert a number, represented as a sequence of digits in one base, to any other base."
 }

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

@@ -1,5 +1,4 @@
 {
-  "blurb": "Given a person's allergy score, determine whether or not they're allergic to a given item, and their full list of allergies.",
   "authors": [
     "ricemery"
   ],
@@ -22,6 +21,7 @@
       "build.sbt"
     ]
   },
+  "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://turing.edu"
 }

exercises/practice/alphametics/.docs/instructions.md

@@ -1,6 +1,6 @@
 # Instructions
 
-Write a function to solve alphametics puzzles.
+Given an alphametics puzzle, find the correct solution.
 
 [Alphametics][alphametics] is a puzzle where letters in words are replaced with numbers.
 
@@ -26,6 +26,4 @@ This is correct because every letter is replaced by a different number and the w
 
 Each letter must represent a different digit, and the leading digit of a multi-digit number must not be zero.
 
-Write a function to solve alphametics puzzles.
-
 [alphametics]: https://en.wikipedia.org/wiki/Alphametics

exercises/practice/alphametics/.meta/config.json

@@ -1,5 +1,4 @@
 {
-  "blurb": "Write a function to solve alphametics puzzles.",
   "authors": [
     "abo64"
   ],
@@ -22,5 +21,6 @@
     "invalidator": [
       "build.sbt"
     ]
-  }
+  },
+  "blurb": "Given an alphametics puzzle, find the correct solution."
 }

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

@@ -1,5 +1,4 @@
 {
-  "blurb": "Given a word and a list of possible anagrams, select the correct sublist.",
   "authors": [
     "sgrif"
   ],
@@ -24,6 +23,7 @@
       "build.sbt"
     ]
   },
+  "blurb": "Given a word and a list of possible anagrams, select the correct sublist.",
   "source": "Inspired by the Extreme Startup game",
   "source_url": "https://github.com/rchatley/extreme_startup"
 }

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

@@ -1,29 +1,36 @@
 {
   "introduction": {
-    "authors": ["bobahop"],
-    "contributors": []
+    "authors": [
+      "bobahop"
+    ]
   },
   "approaches": [
     {
       "uuid": "b4174fe4-eef3-4f21-a4c2-69829c611bef",
       "slug": "tostring-map-sum",
       "title": "toString with map and sum",
       "blurb": "Use toString with map and sum to return the answer.",
-      "authors": ["bobahop"]
+      "authors": [
+        "bobahop"
+      ]
     },
     {
       "uuid": "6efcd9c6-cf20-4b01-af87-938b5afbe81b",
       "slug": "iterate-takewhile-last",
       "title": "iterate with takeWhile and last",
       "blurb": "Use iterate with takeWhile and last to return the answer.",
-      "authors": ["bobahop"]
+      "authors": [
+        "bobahop"
+      ]
     },
     {
       "uuid": "70ebcc42-e087-4724-a28e-26fa26a6e3ac",
       "slug": "recursion",
       "title": "Recursion",
       "blurb": "Use recursion to return the answer.",
-      "authors": ["bobahop"]
+      "authors": [
+        "bobahop"
+      ]
     }
   ]
 }

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

@@ -1,5 +1,4 @@
 {
-  "blurb": "Determine if a number is an Armstrong number.",
   "authors": [
     "ricemery"
   ],
@@ -22,6 +21,7 @@
       "build.sbt"
     ]
   },
+  "blurb": "Determine if a number is an Armstrong number.",
   "source": "Wikipedia",
   "source_url": "https://en.wikipedia.org/wiki/Narcissistic_number"
 }

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

@@ -1,5 +1,4 @@
 {
-  "blurb": "Create an implementation of the atbash cipher, an ancient encryption system created in the Middle East.",
   "authors": [
     "ricemery"
   ],
@@ -22,6 +21,7 @@
       "build.sbt"
     ]
   },
+  "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"
 }

exercises/practice/bank-account/.docs/instructions.md

@@ -3,7 +3,7 @@
 Your task is to implement bank accounts supporting opening/closing, withdrawals, and deposits of money.
 
 As bank accounts can be accessed in many different ways (internet, mobile phones, automatic charges), your bank software must allow accounts to be safely accessed from multiple threads/processes (terminology depends on your programming language) in parallel.
-For example, there may be many deposits and withdrawals occurring in parallel; you need to ensure there is no [race conditions][wikipedia] between when you read the account balance and set the new balance.
+For example, there may be many deposits and withdrawals occurring in parallel; you need to ensure there are no [race conditions][wikipedia] between when you read the account balance and set the new balance.
 
 It should be possible to close an account; operations against a closed account must fail.
 

exercises/practice/bank-account/.meta/config.json

@@ -1,5 +1,4 @@
 {
-  "blurb": "Simulate a bank account supporting opening/closing, withdraws, and deposits of money. Watch out for concurrent transactions!",
   "authors": [
     "ricemery"
   ],
@@ -24,5 +23,6 @@
     "invalidator": [
       "build.sbt"
     ]
-  }
+  },
+  "blurb": "Simulate a bank account supporting opening/closing, withdraws, and deposits of money. Watch out for concurrent transactions!"
 }

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

@@ -1,5 +1,4 @@
 {
-  "blurb": "Produce the lyrics to that beloved classic, that field-trip favorite: 99 Bottles of Beer on the Wall.",
   "authors": [
     "matteobaglini"
   ],
@@ -23,6 +22,7 @@
       "build.sbt"
     ]
   },
+  "blurb": "Produce the lyrics to that beloved classic, that field-trip favorite: 99 Bottles of Beer on the Wall.",
   "source": "Learn to Program by Chris Pine",
   "source_url": "https://pine.fm/LearnToProgram/?Chapter=06"
 }

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

@@ -1,5 +1,4 @@
 {
-  "blurb": "Insert and search for numbers in a binary tree.",
   "authors": [
     "ricemery"
   ],
@@ -22,5 +21,6 @@
       "build.sbt"
     ]
   },
+  "blurb": "Insert and search for numbers in a binary tree.",
   "source": "Josh Cheek"
 }

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

@@ -1,5 +1,4 @@
 {
-  "blurb": "Implement a binary search algorithm.",
   "authors": [
     "ricemery"
   ],
@@ -22,6 +21,7 @@
       "build.sbt"
     ]
   },
+  "blurb": "Implement a binary search algorithm.",
   "source": "Wikipedia",
   "source_url": "https://en.wikipedia.org/wiki/Binary_search_algorithm"
 }

exercises/practice/bob/.approaches/config.json

@@ -1,29 +1,36 @@
 {
   "introduction": {
-    "authors": ["bobahop"],
-    "contributors": []
+    "authors": [
+      "bobahop"
+    ]
   },
   "approaches": [
     {
       "uuid": "72616eff-ad51-469e-adbb-be0ea295ab16",
       "slug": "if-expressions",
       "title": "if expressions",
       "blurb": "Use if expressions to return the answer.",
-      "authors": ["bobahop"]
+      "authors": [
+        "bobahop"
+      ]
     },
     {
       "uuid": "80ad0f5d-9cb7-40aa-b453-d7b36cc6c06e",
       "slug": "match-expression",
       "title": "match expression",
       "blurb": "Use a match expression to return the answer.",
-      "authors": ["bobahop"]
+      "authors": [
+        "bobahop"
+      ]
     },
     {
       "uuid": "6334f482-f75b-4cca-bade-a182fd585c72",
       "slug": "answers-vector",
       "title": "Answers Vector",
       "blurb": "Index into a Vector to return the answer.",
-      "authors": ["bobahop"]
+      "authors": [
+        "bobahop"
+      ]
     }
   ]
 }

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

@@ -1,5 +1,4 @@
 {
-  "blurb": "Bob is a lackadaisical teenager. In conversation, his responses are very limited.",
   "authors": [
     "sgrif"
   ],
@@ -27,6 +26,7 @@
       "build.sbt"
     ]
   },
+  "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/?Chapter=06"
 }

exercises/practice/book-store/.meta/config.json

@@ -1,5 +1,4 @@
 {
-  "blurb": "To try and encourage more sales of different books from a popular 5 book series, a bookshop has decided to offer discounts of multiple-book purchases.",
   "authors": [
     "ricemery"
   ],
@@ -22,6 +21,7 @@
       "build.sbt"
     ]
   },
+  "blurb": "To try and encourage more sales of different books from a popular 5 book series, a bookshop has decided to offer discounts of multiple-book purchases.",
   "source": "Inspired by the harry potter kata from Cyber-Dojo.",
   "source_url": "https://cyber-dojo.org"
 }

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

@@ -1,5 +1,4 @@
 {
-  "blurb": "Score a bowling game.",
   "authors": [
     "ricemery"
   ],
@@ -21,6 +20,7 @@
       "build.sbt"
     ]
   },
+  "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"
 }

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

@@ -1,5 +1,4 @@
 {
-  "blurb": "Correctly determine change to be given using the least number of coins.",
   "authors": [
     "abo64"
   ],
@@ -23,6 +22,7 @@
       "build.sbt"
     ]
   },
+  "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"
 }

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

@@ -11,6 +11,9 @@
     ],
     "example": [
       ".meta/Example.scala"
+    ],
+    "invalidator": [
+      "build.sbt"
     ]
   },
   "blurb": "A data structure that uses a single, fixed-size buffer as if it were connected end-to-end.",