fix: insert blank line after ```

search and replace ```\n< with ```\n\n< to ensure there's an empty line
before closing tags

curriculum/challenges/chinese/10-coding-interview-prep/data-structures/add-a-new-element-to-a-binary-search-tree.chinese.md

@@ -71,4 +71,5 @@ console.info('after the test');
 ```js
 // solution required
 ```
-</section>
+
+/section>

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

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

curriculum/challenges/chinese/10-coding-interview-prep/data-structures/adjacency-list.chinese.md

@@ -53,4 +53,5 @@ var undirectedAdjList = {
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/data-structures/adjacency-matrix.chinese.md

@@ -55,4 +55,5 @@ var adjMatUndirected = [
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/data-structures/breadth-first-search.chinese.md

@@ -73,4 +73,5 @@ console.info('after the test');
 ```js
 // solution required
 ```
-</section>
+
+/section>

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

@@ -71,4 +71,5 @@ console.info('after the test');
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/data-structures/create-a-circular-queue.chinese.md

@@ -86,4 +86,5 @@ class CircularQueue {
 ```js
 // solution required
 ```
-</section>
+
+/section>

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

@@ -78,4 +78,5 @@ console.info('after the test');
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/data-structures/create-a-hash-table.chinese.md

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

curriculum/challenges/chinese/10-coding-interview-prep/data-structures/create-a-linked-list-class.chinese.md

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

curriculum/challenges/chinese/10-coding-interview-prep/data-structures/create-a-map-data-structure.chinese.md

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

curriculum/challenges/chinese/10-coding-interview-prep/data-structures/create-a-priority-queue-class.chinese.md

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

curriculum/challenges/chinese/10-coding-interview-prep/data-structures/create-a-queue-class.chinese.md

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

curriculum/challenges/chinese/10-coding-interview-prep/data-structures/create-a-set-class.chinese.md

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

curriculum/challenges/chinese/10-coding-interview-prep/data-structures/create-a-stack-class.chinese.md

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

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

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

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

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

curriculum/challenges/chinese/10-coding-interview-prep/data-structures/create-and-add-to-sets-in-es6.chinese.md

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

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

@@ -73,4 +73,5 @@ console.info('after the test');
 ```js
 // solution required
 ```
-</section>
+
+/section>

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

@@ -118,4 +118,5 @@ console.info('after the test');
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/data-structures/delete-a-node-with-two-children-in-a-binary-search-tree.chinese.md

@@ -136,4 +136,5 @@ console.info('after the test');
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/data-structures/depth-first-search.chinese.md

@@ -70,4 +70,5 @@ console.log(dfs(exDFSGraph, 3));
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/data-structures/find-the-minimum-and-maximum-height-of-a-binary-search-tree.chinese.md

@@ -79,4 +79,5 @@ console.info('after the test');
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/data-structures/find-the-minimum-and-maximum-value-in-a-binary-search-tree.chinese.md

@@ -75,4 +75,5 @@ console.info('after the test');
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/data-structures/incidence-matrix.chinese.md

@@ -56,4 +56,5 @@ var incMatUndirected = [
 ```js
 // solution required
 ```
-</section>
+
+/section>

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

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

curriculum/challenges/chinese/10-coding-interview-prep/data-structures/invert-a-binary-tree.chinese.md

@@ -71,4 +71,5 @@ console.info('after the test');
 ```js
 // solution required
 ```
-</section>
+
+/section>

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

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

curriculum/challenges/chinese/10-coding-interview-prep/data-structures/perform-a-difference-on-two-sets-of-data.chinese.md

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

curriculum/challenges/chinese/10-coding-interview-prep/data-structures/perform-a-subset-check-on-two-sets-of-data.chinese.md

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

curriculum/challenges/chinese/10-coding-interview-prep/data-structures/perform-a-union-on-two-sets.chinese.md

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

curriculum/challenges/chinese/10-coding-interview-prep/data-structures/perform-an-intersection-on-two-sets-of-data.chinese.md

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

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

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

curriculum/challenges/chinese/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list-by-index.chinese.md

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

curriculum/challenges/chinese/10-coding-interview-prep/data-structures/remove-elements-from-a-linked-list.chinese.md

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

curriculum/challenges/chinese/10-coding-interview-prep/data-structures/remove-items-from-a-set-in-es6.chinese.md

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

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

@@ -75,4 +75,5 @@ console.info('after the test');
 ```js
 // solution required
 ```
-</section>
+
+/section>

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

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

curriculum/challenges/chinese/10-coding-interview-prep/data-structures/typed-arrays.chinese.md

@@ -51,4 +51,5 @@ var i32View;
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/data-structures/use-.has-and-.size-on-an-es6-set.chinese.md

@@ -54,4 +54,5 @@ checkSet([ 1, 2, 3], 2); // Should return [ true, 3 ]
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/data-structures/use-breadth-first-search-in-a-binary-search-tree.chinese.md

@@ -77,4 +77,5 @@ console.info('after the test');
 ```js
 // solution required
 ```
-</section>
+
+/section>

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

@@ -83,4 +83,5 @@ console.info('after the test');
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/data-structures/use-spread-and-notes-for-es5-set-integration.chinese.md

@@ -50,4 +50,5 @@ function checkSet(set){
 ```js
 // solution required
 ```
-</section>
+
+/section>

curriculum/challenges/chinese/10-coding-interview-prep/data-structures/work-with-nodes-in-a-linked-list.chinese.md

@@ -59,4 +59,5 @@ console.log(Kitten.next);
 ```js
 // solution required
 ```
-</section>
+
+/section>