fix: remove guide linting and fix failing challenges

curriculum/challenges/english/02-javascript-algorithms-and-data-structures/es6/create-a-javascript-promise.english.md

@@ -53,4 +53,5 @@ const makeServerRequest = new Promise((resolve, reject) => {
 
 });
 ```
+
 </section>

curriculum/challenges/english/02-javascript-algorithms-and-data-structures/es6/use--to-import-everything-from-a-file.english.md

@@ -18,6 +18,7 @@ The above <code>import</code> statement will create an object called <code>myMat
 myMathModule.add(2,3);
 myMathModule.subtract(5,3);
 ```
+
 </section>
 
 ## Instructions

curriculum/challenges/english/02-javascript-algorithms-and-data-structures/es6/use-destructuring-assignment-to-extract-values-from-objects.english.md

@@ -95,4 +95,5 @@ console.log(yesterday) // should be not defined
 console.log(today); // should be 77
 console.log(tomorrow); // should be 80
 ```
+
 </section>

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']
 ]
 ```
+
 <strong>Game #617</strong>
 
 ```js
@@ -62,6 +63,7 @@ The algorithm follows:
   ['JD', 'KS', 'KC', '4H']
 ]
 ```
+
 </section>
 
 ## Instructions

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]
 ```
+
 </section>
 
 ## Tests

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 <code>.</code> (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.
-<big><big>Rulesets</big></big>
+<span style="font-size: 1.5rem">Rulesets</span>
 Use the following tests on entries:
 <strong>Ruleset 1:</strong>
 <pre>
@@ -52,7 +52,7 @@ Should generate:
 <strong>Ruleset 3:</strong>
 This tests for correct substitution order and may trap simple regexp based replacement routines if special regexp characters are not escaped.
 <pre>
-#BNF Syntax testing rules
+# BNF Syntax testing rules
 A -> apple
 WWWW -> with
 Bgage -> ->.*
@@ -106,7 +106,7 @@ A simple <a href="http://en.wikipedia.org/wiki/Turing_machine" title="link: http
 The tape consists of <code>0</code>s and <code>1</code>s, the states are <code>A</code>, <code>B</code>, <code>C</code> and <code>H</code> (for <code>H</code>alt), and the head position is indicated by writing the state letter before the character where the head is. All parts of the initial tape the machine operates on have to be given in the input.
 Besides demonstrating that the Markov algorithm is Turing-complete, it also made me catch a bug in the C++ implementation which wasn't caught by the first four rulesets.
 <pre>
-#Turing machine: three-state busy beaver
+# Turing machine: three-state busy beaver
 #
 # state A, symbol 0 => write 1, move right, new state B
 A0 -> 1B

package.json

@@ -26,7 +26,6 @@
     "hooks:uninstall": "node node_modules/husky/husky.js uninstall",
     "lint": "npm-run-all -p lint:*",
     "lint:challenges": "cd ./curriculum && npm run lint",
-    "lint:guide": "cd ./tools/lint-guide/ && gulp lint",
     "lint:js": "eslint .",
     "lint:css": "npm run prettier -- --check",
     "prettier": "prettier \"**/*.css\"",