fix(curriculum): added extra line before </section> tag - Engl… (#36278)

curriculum/challenges/english/08-coding-interview-prep/algorithms/implement-quick-sort.english.md

@@ -75,4 +75,5 @@ function isSorted(arr) {
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/data-structures/add-elements-at-a-specific-index-in-a-linked-list.english.md

@@ -138,4 +138,5 @@ function LinkedList() {
 
 
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/data-structures/check-if-an-element-is-present-in-a-binary-search-tree.english.md

@@ -116,4 +116,5 @@ function BinarySearchTree() {
   }
 }
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/data-structures/create-a-doubly-linked-list.english.md

@@ -108,4 +108,5 @@ DoublyLinkedList.prototype = {
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/data-structures/create-a-map-data-structure.english.md

@@ -68,4 +68,5 @@ var Map = function() {
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/data-structures/create-a-queue-class.english.md

@@ -96,4 +96,5 @@ function Queue () {
     // Only change code above this line
 }
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/data-structures/create-a-stack-class.english.md

@@ -89,4 +89,5 @@ class Stack {
   }
 }
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/data-structures/create-a-trie-search-tree.english.md

@@ -66,4 +66,5 @@ var Trie = function() {
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/data-structures/create-an-es6-javascript-map.english.md

@@ -49,4 +49,5 @@ tests:
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/data-structures/delete-a-leaf-node-in-a-binary-search-tree.english.md

@@ -149,4 +149,5 @@ BinarySearchTree.prototype = {
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/data-structures/delete-a-node-with-one-child-in-a-binary-search-tree.english.md

@@ -187,4 +187,5 @@ BinarySearchTree.prototype = {
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/data-structures/implement-heap-sort-with-a-min-heap.english.md

@@ -67,4 +67,5 @@ var MinHeap = function() {
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/data-structures/insert-an-element-into-a-max-heap.english.md

@@ -84,4 +84,5 @@ var MaxHeap = function() {
 	// change code above this line
 };
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/data-structures/learn-how-a-stack-works.english.md

@@ -57,4 +57,5 @@ var homeworkStack = ["BIO12","HIS80","MAT122","PSY44"];
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/data-structures/remove-an-element-from-a-max-heap.english.md

@@ -58,4 +58,5 @@ var MaxHeap = function() {
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/data-structures/reverse-a-doubly-linked-list.english.md

@@ -120,4 +120,5 @@ DoublyLinkedList.prototype = {
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/data-structures/search-within-a-linked-list.english.md

@@ -109,4 +109,5 @@ function LinkedList() {
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/data-structures/use-depth-first-search-in-a-binary-search-tree.english.md

@@ -151,4 +151,5 @@ function BinarySearchTree() {
   };
 }
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-100-arranged-probability.english.md

@@ -54,4 +54,5 @@ euler100();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-101-optimum-polynomial.english.md

@@ -72,4 +72,5 @@ euler101();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-102-triangle-containment.english.md

@@ -58,4 +58,5 @@ euler102();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-103-special-subset-sums-optimum.english.md

@@ -60,4 +60,5 @@ euler103();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-104-pandigital-fibonacci-ends.english.md

@@ -55,4 +55,5 @@ euler104();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-105-special-subset-sums-testing.english.md

@@ -57,4 +57,5 @@ euler105();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-106-special-subset-sums-meta-testing.english.md

@@ -58,4 +58,5 @@ euler106();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-107-minimal-network.english.md

@@ -67,4 +67,5 @@ euler107();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-108-diophantine-reciprocals-i.english.md

@@ -56,4 +56,5 @@ diophantineOne();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-109-darts.english.md

@@ -98,4 +98,5 @@ euler109();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-110-diophantine-reciprocals-ii.english.md

@@ -55,4 +55,5 @@ diophantineTwo();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-111-primes-with-runs.english.md

@@ -104,4 +104,5 @@ euler111();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-112-bouncy-numbers.english.md

@@ -57,4 +57,5 @@ euler112();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-113-non-bouncy-numbers.english.md

@@ -56,4 +56,5 @@ euler113();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-114-counting-block-combinations-i.english.md

@@ -155,4 +155,5 @@ euler114();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-115-counting-block-combinations-ii.english.md

@@ -58,4 +58,5 @@ euler115();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-116-red-green-or-blue-tiles.english.md

@@ -125,4 +125,5 @@ euler116();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-117-red-green-and-blue-tiles.english.md

@@ -133,4 +133,5 @@ euler117();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-118-pandigital-prime-sets.english.md

@@ -53,4 +53,5 @@ euler118();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-119-digit-power-sum.english.md

@@ -55,4 +55,5 @@ euler119();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-120-square-remainders.english.md

@@ -54,4 +54,5 @@ euler120();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-121-disc-game-prize-fund.english.md

@@ -55,4 +55,5 @@ euler121();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-122-efficient-exponentiation.english.md

@@ -59,4 +59,5 @@ euler122();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-123-prime-square-remainders.english.md

@@ -55,4 +55,5 @@ euler123();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-124-ordered-radicals.english.md

@@ -94,4 +94,5 @@ euler124();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-125-palindromic-sums.english.md

@@ -54,4 +54,5 @@ euler125();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-126-cuboid-layers.english.md

@@ -59,4 +59,5 @@ euler126();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-127-abc-hits.english.md

@@ -64,4 +64,5 @@ euler127();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-128-hexagonal-tile-differences.english.md

@@ -61,4 +61,5 @@ euler128();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-129-repunit-divisibility.english.md

@@ -55,4 +55,5 @@ euler129();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-130-composites-with-prime-repunit-property.english.md

@@ -56,4 +56,5 @@ euler130();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-131-prime-cube-partnership.english.md

@@ -55,4 +55,5 @@ euler131();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-132-large-repunit-factors.english.md

@@ -54,4 +54,5 @@ euler132();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-133-repunit-nonfactors.english.md

@@ -55,4 +55,5 @@ euler133();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-134-prime-pair-connection.english.md

@@ -54,4 +54,5 @@ euler134();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-135-same-differences.english.md

@@ -55,4 +55,5 @@ euler135();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-136-singleton-difference.english.md

@@ -55,4 +55,5 @@ euler136();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-137-fibonacci-golden-nuggets.english.md

@@ -73,4 +73,5 @@ euler137();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-138-special-isosceles-triangles.english.md

@@ -57,4 +57,5 @@ euler138();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-139-pythagorean-tiles.english.md

@@ -57,4 +57,5 @@ euler139();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-140-modified-fibonacci-golden-nuggets.english.md

@@ -64,4 +64,5 @@ euler140();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-141-investigating-progressive-numbers-n-which-are-also-square.english.md

@@ -56,4 +56,5 @@ euler141();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-142-perfect-square-collection.english.md

@@ -52,4 +52,5 @@ euler142();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-143-investigating-the-torricelli-point-of-a-triangle.english.md

@@ -57,4 +57,5 @@ euler143();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-144-investigating-multiple-reflections-of-a-laser-beam.english.md

@@ -61,4 +61,5 @@ euler144();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-145-how-many-reversible-numbers-are-there-below-one-billion.english.md

@@ -56,4 +56,5 @@ euler145();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-146-investigating-a-prime-pattern.english.md

@@ -54,4 +54,5 @@ euler146();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-147-rectangles-in-cross-hatched-grids.english.md

@@ -63,4 +63,5 @@ euler147();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-148-exploring-pascals-triangle.english.md

@@ -63,4 +63,5 @@ euler148();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-149-searching-for-a-maximum-sum-subsequence.english.md

@@ -68,4 +68,5 @@ euler149();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-150-searching-a-triangular-array-for-a-sub-triangle-having-minimum-sum.english.md

@@ -77,4 +77,5 @@ euler150();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-151-paper-sheets-of-standard-sizes-an-expected-value-problem.english.md

@@ -59,4 +59,5 @@ euler151();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-152-writing-one-half-as-a-sum-of-inverse-squares.english.md

@@ -56,4 +56,5 @@ euler152();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-153-investigating-gaussian-integers.english.md

@@ -96,4 +96,5 @@ euler153();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-154-exploring-pascals-pyramid.english.md

@@ -59,4 +59,5 @@ euler154();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-155-counting-capacitor-circuits.english.md

@@ -61,4 +61,5 @@ euler155();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-156-counting-digits.english.md

@@ -84,4 +84,5 @@ euler156();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-157-solving-the-diophantine-equation.english.md

@@ -74,4 +74,5 @@ euler157();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.english.md

@@ -59,4 +59,5 @@ euler158();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-159-digital-root-sums-of-factorisations.english.md

@@ -77,4 +77,5 @@ euler159();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-160-factorial-trailing-digits.english.md

@@ -57,4 +57,5 @@ euler160();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-161-triominoes.english.md

@@ -66,4 +66,5 @@ euler161();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-162-hexadecimal-numbers.english.md

@@ -59,4 +59,5 @@ euler162();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-163-cross-hatched-triangles.english.md

@@ -59,4 +59,5 @@ euler163();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-164-numbers-for-which-no-three-consecutive-digits-have-a-sum-greater-than-a-given-value.english.md

@@ -52,4 +52,5 @@ euler164();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-165-intersections.english.md

@@ -69,4 +69,5 @@ euler165();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-166-criss-cross.english.md

@@ -64,4 +64,5 @@ euler166();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-167-investigating-ulam-sequences.english.md

@@ -57,4 +57,5 @@ euler167();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-168-number-rotations.english.md

@@ -55,4 +55,5 @@ euler168();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-169-exploring-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.english.md

@@ -58,4 +58,5 @@ euler169();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-170-find-the-largest-0-to-9-pandigital-that-can-be-formed-by-concatenating-products.english.md

@@ -61,4 +61,5 @@ euler170();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-171-finding-numbers-for-which-the-sum-of-the-squares-of-the-digits-is-a-square.english.md

@@ -56,4 +56,5 @@ euler171();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-172-investigating-numbers-with-few-repeated-digits.english.md

@@ -52,4 +52,5 @@ euler172();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-173-using-up-to-one-million-tiles-how-many-different-hollow-square-laminae-can-be-formed.english.md

@@ -56,4 +56,5 @@ euler173();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-174-counting-the-number-of-hollow-square-laminae-that-can-form-one-two-three-...-distinct-arrangements.english.md

@@ -58,4 +58,5 @@ euler174();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-175-fractions-involving-the-number-of-different-ways-a-number-can-be-expressed-as-a-sum-of-powers-of-2.english.md

@@ -61,4 +61,5 @@ euler175();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-176-right-angled-triangles-that-share-a-cathetus.english.md

@@ -53,4 +53,5 @@ euler176();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-177-integer-angled-quadrilaterals.english.md

@@ -57,4 +57,5 @@ euler177();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-178-step-numbers.english.md

@@ -57,4 +57,5 @@ euler178();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-179-consecutive-positive-divisors.english.md

@@ -52,4 +52,5 @@ euler179();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-180-rational-zeros-of-a-function-of-three-variables.english.md

@@ -60,4 +60,5 @@ euler180();
 ```js
 // solution required
 ```
+
 </section>

curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-181-investigating-in-how-many-ways-objects-of-two-different-colours-can-be-grouped.english.md

@@ -55,4 +55,5 @@ euler181();
 ```js
 // solution required
 ```
+
 </section>