```js
-
+
// add code above this line
stringFunctions.uppercaseString("hello");
diff --git a/curriculum/challenges/english/02-javascript-algorithms-and-data-structures/es6/use-destructuring-assignment-to-extract-values-from-objects.english.md b/curriculum/challenges/english/02-javascript-algorithms-and-data-structures/es6/use-destructuring-assignment-to-extract-values-from-objects.english.md
index 654910338e..53cfddba1f 100644
--- a/curriculum/challenges/english/02-javascript-algorithms-and-data-structures/es6/use-destructuring-assignment-to-extract-values-from-objects.english.md
+++ b/curriculum/challenges/english/02-javascript-algorithms-and-data-structures/es6/use-destructuring-assignment-to-extract-values-from-objects.english.md
@@ -63,7 +63,7 @@ const HIGH_TEMPERATURES = {
// change code below this line
const today = HIGH_TEMPERATURES.today;
-const tomorrow = HIGH_TEMPERATURES.tomorrow;
+const tomorrow = HIGH_TEMPERATURES.tomorrow;
// change code above this line
@@ -95,4 +95,5 @@ console.log(yesterday) // should be not defined
console.log(today); // should be 77
console.log(tomorrow); // should be 80
```
+
diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/24-game.english.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/24-game.english.md
index b2fcf6ab6d..ec3f107b6d 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/24-game.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/24-game.english.md
@@ -13,7 +13,7 @@ The aim of the game is to arrange four numbers in a way that when evaluated, the
## Instructions
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:
- Only the following operators/functions are allowed: multiplication, division, addition, subtraction.
@@ -170,4 +170,4 @@ function solve24(numStr) {
```
-
\ No newline at end of file
+
diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/deal-cards-for-freecell.english.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/deal-cards-for-freecell.english.md
index bb7cb79db2..1a9d1632e8 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/deal-cards-for-freecell.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/deal-cards-for-freecell.english.md
@@ -49,6 +49,7 @@ The algorithm follows:
['6S', '9C', '2H', '6H']
]
```
+
Game #617
```js
@@ -62,6 +63,7 @@ The algorithm follows:
['JD', 'KS', 'KC', '4H']
]
```
+
## Instructions
diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/department-numbers.english.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/department-numbers.english.md
index f245d4e29d..dd3e3fec30 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/department-numbers.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/department-numbers.english.md
@@ -28,6 +28,7 @@ Write a program which outputs all valid combinations as an array.
[4, 7, 1] [6, 1, 5] [6, 2, 4]
[6, 4, 2] [6, 5, 1]
```
+
## Tests
diff --git a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/execute-a-markov-algorithm.english.md b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/execute-a-markov-algorithm.english.md
index f6cb43e9b8..f6b47d18dd 100644
--- a/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/execute-a-markov-algorithm.english.md
+++ b/curriculum/challenges/english/08-coding-interview-prep/rosetta-code/execute-a-markov-algorithm.english.md
@@ -17,7 +17,7 @@ Rules have the syntax:
There is one rule per line.
If there is a
.
(period) present before the [replacement], then this is a terminating rule in which case the interpreter must halt execution.
A ruleset consists of a sequence of rules, with optional comments.
-
Rulesets
+
Rulesets
Use the following tests on entries:
Ruleset 1:
@@ -52,7 +52,7 @@ Should generate:
Ruleset 3:
This tests for correct substitution order and may trap simple regexp based replacement routines if special regexp characters are not escaped.
-#BNF Syntax testing rules
+# BNF Syntax testing rules
A -> apple
WWWW -> with
Bgage -> ->.*
@@ -106,7 +106,7 @@ A simple