Miscellaneous track chores (#282)

* Format exercise configs

* Sync metadata, directions, and filepaths

exercises/concept/booleans/.meta/config.json

@@ -1,11 +1,7 @@
 {
-  "blurb": "TODO: add blurb for booleans exercise",
   "authors": [
     "aimorris"
   ],
-  "forked_from": [
-    "javascript/annalyns-infiltration"
-  ],
   "files": {
     "solution": [
       "src/Booleans.purs"
@@ -20,5 +16,9 @@
       "packages.dhall",
       "spago.dhall"
     ]
-  }
+  },
+  "forked_from": [
+    "javascript/annalyns-infiltration"
+  ],
+  "blurb": "TODO: add blurb for booleans 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": [
     "lpil"
   ],
@@ -24,6 +23,7 @@
       "spago.dhall"
     ]
   },
+  "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/.meta/config.json

@@ -1,5 +1,4 @@
 {
-  "blurb": "Convert a long phrase to its acronym.",
   "authors": [
     "lpil"
   ],
@@ -24,6 +23,7 @@
       "spago.dhall"
     ]
   },
+  "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": [
     "icyrockcom"
   ],
@@ -23,5 +22,6 @@
       "packages.dhall",
       "spago.dhall"
     ]
-  }
+  },
+  "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": [
     "icyrockcom"
   ],
@@ -24,6 +23,7 @@
       "spago.dhall"
     ]
   },
+  "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/anagram/.meta/config.json

@@ -11,6 +11,10 @@
     ],
     "example": [
       "examples/src/Anagram.purs"
+    ],
+    "invalidator": [
+      "packages.dhall",
+      "spago.dhall"
     ]
   },
   "blurb": "Given a word and a list of possible anagrams, select the correct sublist.",

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": [
     "icyrockcom"
   ],
@@ -24,6 +23,7 @@
       "spago.dhall"
     ]
   },
+  "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/binary-search/.meta/config.json

@@ -1,5 +1,4 @@
 {
-  "blurb": "Implement a binary search algorithm.",
   "authors": [
     "icyrockcom"
   ],
@@ -24,6 +23,7 @@
       "spago.dhall"
     ]
   },
+  "blurb": "Implement a binary search algorithm.",
   "source": "Wikipedia",
   "source_url": "https://en.wikipedia.org/wiki/Binary_search_algorithm"
 }

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

@@ -1,5 +1,4 @@
 {
-  "blurb": "Bob is a lackadaisical teenager. In conversation, his responses are very limited.",
   "authors": [
     "lpil"
   ],
@@ -24,6 +23,7 @@
       "spago.dhall"
     ]
   },
+  "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/collatz-conjecture/.meta/config.json

@@ -1,5 +1,4 @@
 {
-  "blurb": "Calculate the number of steps to reach 1 using the Collatz conjecture.",
   "authors": [
     "houli"
   ],
@@ -22,6 +21,7 @@
       "spago.dhall"
     ]
   },
+  "blurb": "Calculate the number of steps to reach 1 using the Collatz conjecture.",
   "source": "An unsolved problem in mathematics named after mathematician Lothar Collatz",
   "source_url": "https://en.wikipedia.org/wiki/3x_%2B_1_problem"
 }

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

@@ -1,5 +1,4 @@
 {
-  "blurb": "Implement the classic method for composing secret messages called a square code.",
   "authors": [
     "icyrockcom"
   ],
@@ -22,6 +21,7 @@
       "spago.dhall"
     ]
   },
+  "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"
 }

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

@@ -1,5 +1,4 @@
 {
-  "blurb": "Given a letter, print a diamond starting with 'A' with the supplied letter at the widest point.",
   "authors": [
     "icyrockcom"
   ],
@@ -22,6 +21,7 @@
       "spago.dhall"
     ]
   },
+  "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/"
 }

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

@@ -1,5 +1,4 @@
 {
-  "blurb": "Find the difference between the square of the sum and the sum of the squares of the first N natural numbers.",
   "authors": [
     "icyrockcom"
   ],
@@ -24,6 +23,7 @@
       "spago.dhall"
     ]
   },
+  "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"
 }

exercises/practice/etl/.meta/config.json

@@ -1,5 +1,4 @@
 {
-  "blurb": "Change the data format for scoring a game to more easily add other languages.",
   "authors": [
     "icyrockcom"
   ],
@@ -22,6 +21,7 @@
       "spago.dhall"
     ]
   },
+  "blurb": "Change the data format for scoring a game to more easily add other languages.",
   "source": "Based on an exercise by the JumpstartLab team for students at The Turing School of Software and Design.",
   "source_url": "https://turing.edu"
 }

exercises/practice/hamming/.docs/instructions.md

@@ -1,6 +1,6 @@
 # Instructions
 
-Calculate the Hamming Distance between two DNA strands.
+Calculate the Hamming distance between two DNA strands.
 
 Your body is made up of cells that contain DNA.
 Those cells regularly wear out and need replacing, which they achieve by dividing into daughter cells.
@@ -9,18 +9,18 @@ In fact, the average human body experiences about 10 quadrillion cell divisions
 When cells divide, their DNA replicates too.
 Sometimes during this process mistakes happen and single pieces of DNA get encoded with the incorrect information.
 If we compare two strands of DNA and count the differences between them we can see how many mistakes occurred.
-This is known as the "Hamming Distance".
+This is known as the "Hamming distance".
 
-We read DNA using the letters C,A,G and T.
+We read DNA using the letters C, A, G and T.
 Two strands might look like this:
 
     GAGCCTACTAACGGGAT
     CATCGTAATGACGGCCT
     ^ ^ ^  ^ ^    ^^
 
-They have 7 differences, and therefore the Hamming Distance is 7.
+They have 7 differences, and therefore the Hamming distance is 7.
 
-The Hamming Distance is useful for lots of things in science, not just biology, so it's a nice phrase to be familiar with :)
+The Hamming distance is useful for lots of things in science, not just biology, so it's a nice phrase to be familiar with :)
 
 ## Implementation notes
 

exercises/practice/hamming/.meta/config.json

@@ -1,5 +1,4 @@
 {
-  "blurb": "Calculate the Hamming difference between two DNA strands.",
   "authors": [
     "stevejb71"
   ],
@@ -24,6 +23,7 @@
       "spago.dhall"
     ]
   },
+  "blurb": "Calculate the Hamming difference between two DNA strands.",
   "source": "The Calculating Point Mutations problem at Rosalind",
   "source_url": "https://rosalind.info/problems/hamm/"
 }

exercises/practice/hello-world/.meta/config.json

@@ -1,5 +1,4 @@
 {
-  "blurb": "Exercism's classic introductory exercise. Just say \"Hello, World!\".",
   "authors": [
     "lpil"
   ],
@@ -24,6 +23,7 @@
       "spago.dhall"
     ]
   },
+  "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"
 }

exercises/practice/isogram/.meta/config.json

@@ -1,5 +1,4 @@
 {
-  "blurb": "Determine if a word or phrase is an isogram.",
   "authors": [
     "icyrockcom"
   ],
@@ -22,6 +21,7 @@
       "spago.dhall"
     ]
   },
+  "blurb": "Determine if a word or phrase is an isogram.",
   "source": "Wikipedia",
   "source_url": "https://en.wikipedia.org/wiki/Isogram"
 }

exercises/practice/knapsack/.meta/config.json

@@ -11,6 +11,10 @@
     ],
     "example": [
       "examples/src/Knapsack.purs"
+    ],
+    "invalidator": [
+      "packages.dhall",
+      "spago.dhall"
     ]
   },
   "blurb": "Given a knapsack that can only carry a certain weight, determine which items to put in the knapsack in order to maximize their combined value.",

exercises/practice/largest-series-product/.meta/config.json

@@ -1,5 +1,4 @@
 {
-  "blurb": "Given a string of digits, calculate the largest product for a contiguous substring of digits of length n.",
   "authors": [
     "icyrockcom"
   ],
@@ -22,6 +21,7 @@
       "spago.dhall"
     ]
   },
+  "blurb": "Given a string of digits, calculate the largest product for a contiguous substring of digits of length n.",
   "source": "A variation on Problem 8 at Project Euler",
   "source_url": "https://projecteuler.net/problem=8"
 }

exercises/practice/leap/.meta/config.json

@@ -1,5 +1,4 @@
 {
-  "blurb": "Determine whether a given year is a leap year.",
   "authors": [
     "lpil"
   ],
@@ -23,6 +22,7 @@
       "spago.dhall"
     ]
   },
+  "blurb": "Determine whether a given year is a leap year.",
   "source": "CodeRanch Cattle Drive, Assignment 3",
   "source_url": "https://coderanch.com/t/718816/Leap"
 }

exercises/practice/matching-brackets/.docs/instructions.md

@@ -1,4 +1,5 @@
 # Instructions
 
 Given a string containing brackets `[]`, braces `{}`, parentheses `()`, or any combination thereof, verify that any and all pairs are matched and nested correctly.
-The string may also contain other characters, which for the purposes of this exercise should be ignored.
+Any other characters should be ignored.
+For example, `"{what is (42)}?"` is balanced and `"[text}"` is not.

exercises/practice/matching-brackets/.docs/introduction.md

@@ -0,0 +1,8 @@
+# Introduction
+
+You're given the opportunity to write software for the Bracketeer™, an ancient but powerful mainframe.
+The software that runs on it is written in a proprietary language.
+Much of its syntax is familiar, but you notice _lots_ of brackets, braces and parentheses.
+Despite the Bracketeer™ being powerful, it lacks flexibility.
+If the source code has any unbalanced brackets, braces or parentheses, the Bracketeer™ crashes and must be rebooted.
+To avoid such a scenario, you start writing code that can verify that brackets, braces, and parentheses are balanced before attempting to run it on the Bracketeer™.

exercises/practice/matching-brackets/.meta/config.json

@@ -1,6 +1,4 @@
 {
-  "blurb": "Make sure the brackets and braces all match.",
-  "source": "Ginna Baker",
   "authors": [],
   "files": {
     "solution": [
@@ -16,5 +14,7 @@
       "packages.dhall",
       "spago.dhall"
     ]
-  }
+  },
+  "blurb": "Make sure the brackets and braces all match.",
+  "source": "Ginna Baker"
 }

exercises/practice/meetup/.meta/config.json

@@ -1,5 +1,4 @@
 {
-  "blurb": "Calculate the date of meetups.",
   "authors": [
     "icyrockcom"
   ],
@@ -23,5 +22,6 @@
       "spago.dhall"
     ]
   },
+  "blurb": "Calculate the date of meetups.",
   "source": "Jeremy Hinegardner mentioned a Boulder meetup that happens on the Wednesteenth of every month"
 }

exercises/practice/pangram/.meta/config.json

@@ -1,5 +1,4 @@
 {
-  "blurb": "Determine if a sentence is a pangram.",
   "authors": [
     "lpil"
   ],
@@ -24,6 +23,7 @@
       "spago.dhall"
     ]
   },
+  "blurb": "Determine if a sentence is a pangram.",
   "source": "Wikipedia",
   "source_url": "https://en.wikipedia.org/wiki/Pangram"
 }