diff --git a/curriculum/challenges/english/02-javascript-algorithms-and-data-structures/basic-javascript/understanding-case-sensitivity-in-variables.md b/curriculum/challenges/english/02-javascript-algorithms-and-data-structures/basic-javascript/understanding-case-sensitivity-in-variables.md
index a0891ef841..e7fcb1247b 100644
--- a/curriculum/challenges/english/02-javascript-algorithms-and-data-structures/basic-javascript/understanding-case-sensitivity-in-variables.md
+++ b/curriculum/challenges/english/02-javascript-algorithms-and-data-structures/basic-javascript/understanding-case-sensitivity-in-variables.md
@@ -13,7 +13,7 @@ In JavaScript all variables and function names are case sensitive. This means th
`MYVAR` is not the same as `MyVar` nor `myvar`. It is possible to have multiple distinct variables with the same name but different casing. It is strongly recommended that for the sake of clarity, you *do not* use this language feature.
-
Best Practice
+**Best Practice**
Write variable names in JavaScript in camelCase. In camelCase, multi-word variable names have the first word in lowercase and the first letter of each subsequent word is capitalized.
diff --git a/curriculum/challenges/english/05-apis-and-microservices/mongodb-and-mongoose/chain-search-query-helpers-to-narrow-search-results.md b/curriculum/challenges/english/05-apis-and-microservices/mongodb-and-mongoose/chain-search-query-helpers-to-narrow-search-results.md
index 210e970019..12be099f8a 100644
--- a/curriculum/challenges/english/05-apis-and-microservices/mongodb-and-mongoose/chain-search-query-helpers-to-narrow-search-results.md
+++ b/curriculum/challenges/english/05-apis-and-microservices/mongodb-and-mongoose/chain-search-query-helpers-to-narrow-search-results.md
@@ -14,15 +14,6 @@ If you don’t pass the callback as the last argument to `Model.find()` (or to t
Modify the `queryChain` function to find people who like the food specified by the variable named `foodToSearch`. Sort them by `name`, limit the results to two documents, and hide their age. Chain `.find()`, `.sort()`, `.limit()`, `.select()`, and then `.exec()`. Pass the `done(err, data)` callback to `exec()`.
-## Further Reading
-
-If you are eager to learn and want to go deeper, You may look at:
-
-- Indexes ( very important for query efficiency ),
-- Pre/Post hooks,
-- Validation,
-- Schema Virtuals and Model, Static, and Instance methods,
-
# --hints--
Chaining query helpers should succeed
diff --git a/curriculum/challenges/english/09-information-security/information-security-with-helmetjs/configure-helmet-using-the-parent-helmet-middleware.md b/curriculum/challenges/english/09-information-security/information-security-with-helmetjs/configure-helmet-using-the-parent-helmet-middleware.md
index adccebc688..6865d3896c 100644
--- a/curriculum/challenges/english/09-information-security/information-security-with-helmetjs/configure-helmet-using-the-parent-helmet-middleware.md
+++ b/curriculum/challenges/english/09-information-security/information-security-with-helmetjs/configure-helmet-using-the-parent-helmet-middleware.md
@@ -12,7 +12,7 @@ As a reminder, this project is being built upon the following starter project on
`app.use(helmet())` will automatically include all the middleware introduced above, except `noCache()`, and `contentSecurityPolicy()`, but these can be enabled if necessary. You can also disable or configure any other middleware individually, using a configuration object.
-Example:
+**Example:**
```js
app.use(helmet({
diff --git a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/24-game.md b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/24-game.md
index a732d46b8f..80b03ca6a5 100644
--- a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/24-game.md
+++ b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/24-game.md
@@ -16,7 +16,7 @@ The aim of the game is to arrange four numbers in a way that when evaluated, the
Implement a function that takes a string of four digits as its argument, with each digit from 1 to 9 (inclusive) with repetitions allowed, and returns an arithmetic expression that evaluates to the number 24. If no such solution exists, return "no solution exists".
-Rules:
+**Rules:**
- Only the following operators/functions are allowed: multiplication, division, addition, subtraction.
- Division should use floating point or rational arithmetic, etc, to preserve remainders.
diff --git a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/balanced-brackets.md b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/balanced-brackets.md
index 04536c47f3..e32338e301 100644
--- a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/balanced-brackets.md
+++ b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/balanced-brackets.md
@@ -10,8 +10,7 @@ dashedName: balanced-brackets
Determine whether a generated string of brackets is balanced; that is, whether it consists entirely of pairs of opening/closing brackets (in that order), none of which mis-nest.
-Examples:
-
+**Examples:**
| Input | Output |
| ------------------------- | ------ |
| \[]
| true |
diff --git a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/hash-join.md b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/hash-join.md
index 60095d6bc6..d2d5cabf4f 100644
--- a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/hash-join.md
+++ b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/hash-join.md
@@ -41,7 +41,7 @@ In pseudo-code, the algorithm could be expressed as follows:
Implement the "hash join" algorithm as a function and demonstrate that it passes the test-case listed below. The function should accept two arrays of objects and return an array of combined objects.
-Input
+**Input**
@@ -127,7 +127,7 @@ Implement the "hash join" algorithm as a function and demonstrate that it passes
-Output
+**Output**
| A_age | A_name | B_character | B_nemesis |
| ----- | ------ | ----------- | --------- |
diff --git a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/zhang-suen-thinning-algorithm.md b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/zhang-suen-thinning-algorithm.md
index 10b8fa68c1..64d4e8b5d4 100644
--- a/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/zhang-suen-thinning-algorithm.md
+++ b/curriculum/challenges/english/10-coding-interview-prep/rosetta-code/zhang-suen-thinning-algorithm.md
@@ -70,7 +70,7 @@ Obviously the boundary pixels of the image cannot have the full eight neighbours
- Define $B(P1)$ = the number of black pixel neighbours of P1. ( = sum(P2 .. P9) )
-Step 1:
+**Step 1:**
All pixels are tested and pixels satisfying all the following conditions (simultaneously) are just noted at this stage.
@@ -84,7 +84,7 @@ All pixels are tested and pixels satisfying all the following conditions (simult
After iterating over the image and collecting all the pixels satisfying all step 1 conditions, all these condition satisfying pixels are set to white.
-Step 2:
+**Step 2:**
All pixels are again tested and pixels satisfying all the following conditions are just noted at this stage.
@@ -98,7 +98,7 @@ All pixels are again tested and pixels satisfying all the following conditions a
After iterating over the image and collecting all the pixels satisfying all step 2 conditions, all these condition satisfying pixels are again set to white.
-Iteration:
+**Iteration:**
If any pixels were set in this round of either step 1 or step 2 then all steps are repeated until no image pixels are so changed.