Fix README's

andreimaximov · andreimaximov · commit 4d7931b4d0c5 · 2018-01-23T23:31:24.000-08:00
- Add HackerRank AI section
- Fix HackerRAnk directory links
- Fix README headers
diff --git a/README.md b/README.md
@@ -9,7 +9,7 @@ easily understandable algorithms for learning purposes.
 
 ## HackerRank
 
-- [Algorithms](algorithms)
+- [Algorithms](hacker-rank/algorithms)
   - [Bit Manipulation](hacker-rank/algorithms/bit-manipulation)
     * [AND Product](hacker-rank/algorithms/bit-manipulation/and-product)
     * [Cipher](hacker-rank/algorithms/bit-manipulation/cipher)
@@ -55,7 +55,9 @@ easily understandable algorithms for learning purposes.
     * [Pangrams](hacker-rank/algorithms/strings/pangrams)
     * [Sherlock and Anagrams](hacker-rank/algorithms/strings/sherlock-and-anagrams)
     * [Two Strings](hacker-rank/algorithms/strings/two-strings)
-- [Data Structures](data-structures)
+- [Artificial Intelligence](hacker-rank/artificial-intelligence)
+  - [Tic Tac Toe](hacker-rank/artificial-intelligence/alpha-beta-pruning/tic-tac-toe)
+- [Data Structures](hacker-rank/data-structures)
   - [Disjoint Set](hacker-rank/data-structures/disjoint-set)
     * [Merging Communities](hacker-rank/data-structures/disjoint-set/merging-communities)
   - [Heap](hacker-rank/data-structures/heap)
@@ -66,7 +68,7 @@ easily understandable algorithms for learning purposes.
     * [Self Balancing Tree](hacker-rank/data-structures/tree/self-balancing-tree)
   - [Trie](hacker-rank/data-structures/trie)
     * [No Prefix Set](hacker-rank/data-structures/trie/no-prefix-set)
-- [Mathematics](mathematics)
+- [Mathematics](hacker-rank/mathematics)
   - [Combinatorics](hacker-rank/mathematics/combinatorics)
     * [Choose and Calculate](hacker-rank/mathematics/combinatorics/choose-and-calculate)
     * [Journey to Mars](hacker-rank/mathematics/combinatorics/journey-to-mars)
diff --git a/geeks-for-geeks/dynamic-programming/set-18-partition-problem/README.md b/geeks-for-geeks/dynamic-programming/set-18-partition-problem/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [http://www.geeksforgeeks.org/dynamic-programming-set-18-partition-problem/](http://www.geeksforgeeks.org/dynamic-programming-set-18-partition-problem/)
diff --git a/hacker-rank/algorithms/bit-manipulation/and-product/README.md b/hacker-rank/algorithms/bit-manipulation/and-product/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/and-product](https://www.hackerrank.com/challenges/and-product)
diff --git a/hacker-rank/algorithms/bit-manipulation/cipher/README.md b/hacker-rank/algorithms/bit-manipulation/cipher/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/cipher](https://www.hackerrank.com/challenges/cipher)
diff --git a/hacker-rank/algorithms/bit-manipulation/flipping-bits/README.md b/hacker-rank/algorithms/bit-manipulation/flipping-bits/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/flipping-bits](https://www.hackerrank.com/challenges/flipping-bits)
diff --git a/hacker-rank/algorithms/dynamic-programming/candies/README.md b/hacker-rank/algorithms/dynamic-programming/candies/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/candies](https://www.hackerrank.com/challenges/candies)
diff --git a/hacker-rank/algorithms/dynamic-programming/coin-change/README.md b/hacker-rank/algorithms/dynamic-programming/coin-change/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/coin-change](https://www.hackerrank.com/challenges/coin-change)
diff --git a/hacker-rank/algorithms/dynamic-programming/fibonacci-modified/README.md b/hacker-rank/algorithms/dynamic-programming/fibonacci-modified/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/fibonacci-modified](https://www.hackerrank.com/challenges/fibonacci-modified)
diff --git a/hacker-rank/algorithms/dynamic-programming/grid-walking/README.md b/hacker-rank/algorithms/dynamic-programming/grid-walking/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/grid-walking](https://www.hackerrank.com/challenges/grid-walking)
diff --git a/hacker-rank/algorithms/dynamic-programming/longest-common-subsequence/README.md b/hacker-rank/algorithms/dynamic-programming/longest-common-subsequence/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/dynamic-programming-classics-the-longest-common-subsequence](https://www.hackerrank.com/challenges/dynamic-programming-classics-the-longest-common-subsequence)
diff --git a/hacker-rank/algorithms/dynamic-programming/longest-increasing-subsequence/README.md b/hacker-rank/algorithms/dynamic-programming/longest-increasing-subsequence/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/longest-increasing-subsequent](https://www.hackerrank.com/challenges/longest-increasing-subsequent)
diff --git a/hacker-rank/algorithms/dynamic-programming/maximum-subarray/README.md b/hacker-rank/algorithms/dynamic-programming/maximum-subarray/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/maxsubarray](https://www.hackerrank.com/challenges/maxsubarray)
diff --git a/hacker-rank/algorithms/dynamic-programming/square-subsequences/README.md b/hacker-rank/algorithms/dynamic-programming/square-subsequences/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/square-subsequences](https://www.hackerrank.com/challenges/square-subsequences)
diff --git a/hacker-rank/algorithms/dynamic-programming/stock-maximize/README.md b/hacker-rank/algorithms/dynamic-programming/stock-maximize/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/stockmax](https://www.hackerrank.com/challenges/stockmax)
diff --git a/hacker-rank/algorithms/graph-theory/bfs-shortest-reach/README.md b/hacker-rank/algorithms/graph-theory/bfs-shortest-reach/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/bfsshortreach](https://www.hackerrank.com/challenges/bfsshortreach)
diff --git a/hacker-rank/algorithms/graph-theory/dijkstra-shortest-reach-2/README.md b/hacker-rank/algorithms/graph-theory/dijkstra-shortest-reach-2/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/dijkstrashortreach](https://www.hackerrank.com/challenges/dijkstrashortreach)
diff --git a/hacker-rank/algorithms/graph-theory/floyd-city-of-blinding-lights/README.md b/hacker-rank/algorithms/graph-theory/floyd-city-of-blinding-lights/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/floyd-city-of-blinding-lights](https://www.hackerrank.com/challenges/floyd-city-of-blinding-lights)
diff --git a/hacker-rank/algorithms/graph-theory/jack-goes-to-rapture/README.md b/hacker-rank/algorithms/graph-theory/jack-goes-to-rapture/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/jack-goes-to-rapture](https://www.hackerrank.com/challenges/jack-goes-to-rapture)
diff --git a/hacker-rank/algorithms/graph-theory/journey-to-the-moon/README.md b/hacker-rank/algorithms/graph-theory/journey-to-the-moon/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/journey-to-the-moon](https://www.hackerrank.com/challenges/journey-to-the-moon)
diff --git a/hacker-rank/algorithms/graph-theory/kruskal-mst-really-special-subtree/README.md b/hacker-rank/algorithms/graph-theory/kruskal-mst-really-special-subtree/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/kruskalmstrsub](https://www.hackerrank.com/challenges/kruskalmstrsub)
diff --git a/hacker-rank/algorithms/graph-theory/prims-mst-special-subtree/README.md b/hacker-rank/algorithms/graph-theory/prims-mst-special-subtree/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/primsmstsub](https://www.hackerrank.com/challenges/primsmstsub)
diff --git a/hacker-rank/algorithms/implementation/matrix-rotation/README.md b/hacker-rank/algorithms/implementation/matrix-rotation/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/matrix-rotation-algo](https://www.hackerrank.com/challenges/matrix-rotation-algo)
diff --git a/hacker-rank/algorithms/search/connected-cell-in-a-grid/README.md b/hacker-rank/algorithms/search/connected-cell-in-a-grid/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/connected-cell-in-a-grid](https://www.hackerrank.com/challenges/connected-cell-in-a-grid)
diff --git a/hacker-rank/algorithms/search/cut-the-tree/README.md b/hacker-rank/algorithms/search/cut-the-tree/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/cut-the-tree](https://www.hackerrank.com/challenges/cut-the-tree)
diff --git a/hacker-rank/algorithms/search/maximise-sum/README.md b/hacker-rank/algorithms/search/maximise-sum/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/maximise-sum](https://www.hackerrank.com/challenges/maximise-sum)
diff --git a/hacker-rank/algorithms/search/missing-numbers/README.md b/hacker-rank/algorithms/search/missing-numbers/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/missing-numbers] (https://www.hackerrank.com/challenges/missing-numbers)
diff --git a/hacker-rank/algorithms/search/pairs/README.md b/hacker-rank/algorithms/search/pairs/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/pairs](https://www.hackerrank.com/challenges/pairs)
diff --git a/hacker-rank/algorithms/search/playing-with-numbers/README.md b/hacker-rank/algorithms/search/playing-with-numbers/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/playing-with-numbers](https://www.hackerrank.com/challenges/playing-with-numbers)
diff --git a/hacker-rank/algorithms/search/sherlock-and-array/README.md b/hacker-rank/algorithms/search/sherlock-and-array/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/sherlock-and-array](https://www.hackerrank.com/challenges/sherlock-and-array)
diff --git a/hacker-rank/algorithms/sorting/quicksort-in-place/README.md b/hacker-rank/algorithms/sorting/quicksort-in-place/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/quicksort3](https://www.hackerrank.com/challenges/quicksort3)
diff --git a/hacker-rank/algorithms/strings/bigger-is-greater/README.md b/hacker-rank/algorithms/strings/bigger-is-greater/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/bigger-is-greater](https://www.hackerrank.com/challenges/bigger-is-greater)
diff --git a/hacker-rank/algorithms/strings/common-child/README.md b/hacker-rank/algorithms/strings/common-child/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/common-child](https://www.hackerrank.com/challenges/common-child)
diff --git a/hacker-rank/algorithms/strings/pangrams/README.md b/hacker-rank/algorithms/strings/pangrams/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/pangrams](https://www.hackerrank.com/challenges/pangrams)
diff --git a/hacker-rank/algorithms/strings/sherlock-and-anagrams/README.md b/hacker-rank/algorithms/strings/sherlock-and-anagrams/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/sherlock-and-anagrams](https://www.hackerrank.com/challenges/sherlock-and-anagrams)
diff --git a/hacker-rank/algorithms/strings/two-strings/README.md b/hacker-rank/algorithms/strings/two-strings/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/two-strings](https://www.hackerrank.com/challenges/two-strings)
diff --git a/hacker-rank/data-structures/disjoint-set/merging-communities/README.md b/hacker-rank/data-structures/disjoint-set/merging-communities/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/merging-communities](https://www.hackerrank.com/challenges/merging-communities)
diff --git a/hacker-rank/data-structures/heap/find-median/README.md b/hacker-rank/data-structures/heap/find-median/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/find-median-1](https://www.hackerrank.com/challenges/find-median-1)
diff --git a/hacker-rank/data-structures/tree/bst-lowest-common-ancestor/README.md b/hacker-rank/data-structures/tree/bst-lowest-common-ancestor/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/binary-search-tree-lowest-common-ancestor](https://www.hackerrank.com/challenges/binary-search-tree-lowest-common-ancestor)
diff --git a/hacker-rank/data-structures/tree/median-updates/README.md b/hacker-rank/data-structures/tree/median-updates/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/median](https://www.hackerrank.com/challenges/median)
diff --git a/hacker-rank/data-structures/tree/self-balancing-tree/README.md b/hacker-rank/data-structures/tree/self-balancing-tree/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/self-balancing-tree](https://www.hackerrank.com/challenges/self-balancing-tree)
diff --git a/hacker-rank/data-structures/trie/no-prefix-set/README.md b/hacker-rank/data-structures/trie/no-prefix-set/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/no-prefix-set](https://www.hackerrank.com/challenges/no-prefix-set)
diff --git a/hacker-rank/mathematics/combinatorics/choose-and-calculate/README.md b/hacker-rank/mathematics/combinatorics/choose-and-calculate/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/choose-and-calculate](https://www.hackerrank.com/challenges/choose-and-calculate)
diff --git a/hacker-rank/mathematics/combinatorics/journey-to-mars/README.md b/hacker-rank/mathematics/combinatorics/journey-to-mars/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/ajourney](https://www.hackerrank.com/challenges/ajourney)
diff --git a/hacker-rank/mathematics/combinatorics/ncr-table/README.md b/hacker-rank/mathematics/combinatorics/ncr-table/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://www.hackerrank.com/challenges/ncr-table](https://www.hackerrank.com/challenges/ncr-table)
diff --git a/leetcode/algorithms/binary-tree-inorder-postorder/README.md b/leetcode/algorithms/binary-tree-inorder-postorder/README.md
@@ -1,4 +1,4 @@
-#README
+# README
 
 [https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/)
 
diff --git a/leetcode/algorithms/binary-tree-inorder-preorder/README.md b/leetcode/algorithms/binary-tree-inorder-preorder/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/)
diff --git a/leetcode/algorithms/closest-palindrome/README.md b/leetcode/algorithms/closest-palindrome/README.md
@@ -1,4 +1,4 @@
-#README
+# README
 
 [https://leetcode.com/contest/leetcode-weekly-contest-29/problems/find-the-closest-palindrome/](https://leetcode.com/contest/leetcode-weekly-contest-29/problems/find-the-closest-palindrome/)
 
diff --git a/leetcode/algorithms/contains-duplicate-iii/README.md b/leetcode/algorithms/contains-duplicate-iii/README.md
@@ -1,4 +1,4 @@
-#README
+# README
 
 [https://leetcode.com/problems/contains-duplicate-iii/](https://leetcode.com/problems/contains-duplicate-iii/)
 
diff --git a/leetcode/algorithms/data-stream-disjoint-intervals/README.md b/leetcode/algorithms/data-stream-disjoint-intervals/README.md
@@ -1,4 +1,4 @@
-#README
+# README
 
 [https://leetcode.com/problems/data-stream-as-disjoint-intervals/](https://leetcode.com/problems/data-stream-as-disjoint-intervals/)
 
diff --git a/leetcode/algorithms/different-ways-to-add-parenthesis/README.md b/leetcode/algorithms/different-ways-to-add-parenthesis/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://leetcode.com/problems/different-ways-to-add-parentheses/](https://leetcode.com/problems/different-ways-to-add-parentheses/)
diff --git a/leetcode/algorithms/edit-distance/README.md b/leetcode/algorithms/edit-distance/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://leetcode.com/problems/edit-distance/](https://leetcode.com/problems/edit-distance/)
diff --git a/leetcode/algorithms/game-of-life/README.md b/leetcode/algorithms/game-of-life/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://leetcode.com/problems/game-of-life/](https://leetcode.com/problems/game-of-life/)
diff --git a/leetcode/algorithms/is-balanced/README.md b/leetcode/algorithms/is-balanced/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://leetcode.com/problems/balanced-binary-tree/](https://leetcode.com/problems/balanced-binary-tree/)
diff --git a/leetcode/algorithms/k-pairs-with-smallest-sums/README.md b/leetcode/algorithms/k-pairs-with-smallest-sums/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://leetcode.com/problems/find-k-pairs-with-smallest-sums/](https://leetcode.com/problems/find-k-pairs-with-smallest-sums/)
diff --git a/leetcode/algorithms/kth-largest-element/README.md b/leetcode/algorithms/kth-largest-element/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://leetcode.com/problems/kth-largest-element-in-an-array/](https://leetcode.com/problems/kth-largest-element-in-an-array/)
diff --git a/leetcode/algorithms/largest-rectangle-in-histogram/README.md b/leetcode/algorithms/largest-rectangle-in-histogram/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://leetcode.com/problems/largest-rectangle-in-histogram/](https://leetcode.com/problems/largest-rectangle-in-histogram/)
diff --git a/leetcode/algorithms/lca-binary-tree/README.md b/leetcode/algorithms/lca-binary-tree/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/)
diff --git a/leetcode/algorithms/lexicographical-numbers/README.md b/leetcode/algorithms/lexicographical-numbers/README.md
@@ -1,4 +1,4 @@
-#README
+# README
 
 [https://leetcode.com/problems/lexicographical-numbers/](https://leetcode.com/problems/lexicographical-numbers/)
 
diff --git a/leetcode/algorithms/majority-element-ii/README.md b/leetcode/algorithms/majority-element-ii/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://leetcode.com/problems/majority-element-ii/](https://leetcode.com/problems/majority-element-ii/)
diff --git a/leetcode/algorithms/max-points-on-a-line/README.md b/leetcode/algorithms/max-points-on-a-line/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://leetcode.com/problems/max-points-on-a-line/](https://leetcode.com/problems/max-points-on-a-line/)
diff --git a/leetcode/algorithms/median-of-two-sorted-arrays/README.md b/leetcode/algorithms/median-of-two-sorted-arrays/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://leetcode.com/problems/median-of-two-sorted-arrays/](https://leetcode.com/problems/median-of-two-sorted-arrays/)
diff --git a/leetcode/algorithms/minimum-height-tree/README.md b/leetcode/algorithms/minimum-height-tree/README.md
@@ -1,4 +1,4 @@
-#README
+# README
 
 [https://leetcode.com/problems/minimum-height-trees/](https://leetcode.com/problems/minimum-height-trees/)
 
diff --git a/leetcode/algorithms/n-queens-ii/README.md b/leetcode/algorithms/n-queens-ii/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://leetcode.com/problems/n-queens-ii/](https://leetcode.com/problems/n-queens-ii/)
diff --git a/leetcode/algorithms/palindrome-linked-list/README.md b/leetcode/algorithms/palindrome-linked-list/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://leetcode.com/problems/palindrome-linked-list/](https://leetcode.com/problems/palindrome-linked-list/)
diff --git a/leetcode/algorithms/palindrome-pairs/README.md b/leetcode/algorithms/palindrome-pairs/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://leetcode.com/problems/palindrome-pairs/](https://leetcode.com/problems/palindrome-pairs/)
diff --git a/leetcode/algorithms/rectangle-area/README.md b/leetcode/algorithms/rectangle-area/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://leetcode.com/problems/rectangle-area/](https://leetcode.com/problems/rectangle-area/)
diff --git a/leetcode/algorithms/regular-expression-matching/README.md b/leetcode/algorithms/regular-expression-matching/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://leetcode.com/problems/regular-expression-matching/](https://leetcode.com/problems/regular-expression-matching/)
diff --git a/leetcode/algorithms/remove-duplicates-from-sorted-array-ii/README.md b/leetcode/algorithms/remove-duplicates-from-sorted-array-ii/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/)
diff --git a/leetcode/algorithms/reverse-nodes-k-group/README.md b/leetcode/algorithms/reverse-nodes-k-group/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://leetcode.com/problems/reverse-nodes-in-k-group/](https://leetcode.com/problems/reverse-nodes-in-k-group/)
diff --git a/leetcode/algorithms/reverse-words-in-a-string/README.md b/leetcode/algorithms/reverse-words-in-a-string/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://leetcode.com/problems/reverse-words-in-a-string/](https://leetcode.com/problems/reverse-words-in-a-string/)
diff --git a/leetcode/algorithms/rotate-image/README.md b/leetcode/algorithms/rotate-image/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://leetcode.com/problems/rotate-image/](https://leetcode.com/problems/rotate-image/)
diff --git a/leetcode/algorithms/set-matrix-zeroes/README.md b/leetcode/algorithms/set-matrix-zeroes/README.md
@@ -1,3 +1,3 @@
-#README
+# README
 
 [https://leetcode.com/problems/set-matrix-zeroes/](https://leetcode.com/problems/set-matrix-zeroes/)
diff --git a/leetcode/algorithms/shortest-palindrome/README.md b/leetcode/algorithms/shortest-palindrome/README.md
@@ -1,4 +1,4 @@
-#README
+# README
 
 [https://leetcode.com/problems/shortest-palindrome/](https://leetcode.com/problems/shortest-palindrome/)
 
diff --git a/leetcode/algorithms/skyline/README.md b/leetcode/algorithms/skyline/README.md
diff --git a/leetcode/algorithms/sorted-array-to-bst/README.md b/leetcode/algorithms/sorted-array-to-bst/README.md
diff --git a/leetcode/algorithms/spiral-matrix/README.md b/leetcode/algorithms/spiral-matrix/README.md
diff --git a/leetcode/algorithms/stock-profit-iv/README.md b/leetcode/algorithms/stock-profit-iv/README.md
diff --git a/leetcode/algorithms/subsets-ii/README.md b/leetcode/algorithms/subsets-ii/README.md
diff --git a/leetcode/algorithms/validate-bst/README.md b/leetcode/algorithms/validate-bst/README.md
