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

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>