update readme

Author: hogan-tech

.github/test.txt

@@ -1 +1 @@
-2464-minimum-subarrays-in-a-valid-split python medium
+1526-minimum-number-of-increments-on-subarrays-to-form-a-target-array python hard

1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array/1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array.py renamed to Python/1526-minimum-number-of-increments-on-subarrays-to-form-a-target-array.py

@@ -251,6 +251,7 @@
 | 1518 | [Water Bottles](https://leetcode.com/problems/water-bottles/)                                                                                                                                | [Python](./Python/1518-water-bottles.py)                                                                 | [Easy](./Readme/1518-water-bottles.md)                                                                   |
 | 1524 | [Number of Sub-arrays With Odd Sum](https://leetcode.com/problems/number-of-sub-arrays-with-odd-sum)                                                                                         | [Python](./Python/1524-number-of-sub-arrays-with-odd-sum.py)                                             | [Medium](./Readme/1524-number-of-sub-arrays-with-odd-sum.md)                                             |
 | 1525 | [Number of Good Ways to Split a String](https://leetcode.com/problems/number-of-good-ways-to-split-a-string)                                                                                 | [Python](./Python/1525-number-of-good-ways-to-split-a-string.py)                                         | [Medium](./Readme/1525-number-of-good-ways-to-split-a-string.md)                                         |
+| 1526 | [Minimum Number of Increments on Subarrays to Form a Target Array](https://leetcode.com/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array/)                          | [Python](./Python/1526-minimum-number-of-increments-on-subarrays-to-form-a-target-array.py)              | [Hard](./Readme/1526-minimum-number-of-increments-on-subarrays-to-form-a-target-array.md)                |
 | 1529 | [Minimum Suffix Flips](https://leetcode.com/problems/minimum-suffix-flips)                                                                                                                   | [Python](./Python/1529-minimum-suffix-flips.py)                                                          | [Medium](./Readme/1529-minimum-suffix-flips.md)                                                          |
 | 1530 | [Number of Good Leaf Nodes Pairs](https://leetcode.com/problems/number-of-good-leaf-nodes-pairs/)                                                                                            | [Python](./Python/1530-number-of-good-leaf-nodes-pairs.py)                                               | [Medium](./Readme/1530-number-of-good-leaf-nodes-pairs.md)                                               |
 | 1531 | [String Compression II](https://leetcode.com/problems/string-compression-ii/)                                                                                                                | [Python](./Python/1531-string-compression-ii.py)                                                         | [Hard](./Readme/1531-string-compression-ii.md)                                                           |

Question_List_1001_2000.md

@@ -115,52 +115,3 @@ It helps others discover the repo and keeps the project growing.
 ---
 
 Feedback / Questions → open an Issue or reach out on [LinkedIn](https://www.linkedin.com/in/hogan-l/)  
-
-<!---LeetCode Topics Start-->
-# LeetCode Topics
-## Array
-|  |
-| ------- |
-| [0315-count-of-smaller-numbers-after-self](https://github.com/hogan-tech/leetcode-solution/tree/master/0315-count-of-smaller-numbers-after-self) |
-| [1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array](https://github.com/hogan-tech/leetcode-solution/tree/master/1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array) |
-## Binary Search
-|  |
-| ------- |
-| [0315-count-of-smaller-numbers-after-self](https://github.com/hogan-tech/leetcode-solution/tree/master/0315-count-of-smaller-numbers-after-self) |
-## Divide and Conquer
-|  |
-| ------- |
-| [0315-count-of-smaller-numbers-after-self](https://github.com/hogan-tech/leetcode-solution/tree/master/0315-count-of-smaller-numbers-after-self) |
-## Binary Indexed Tree
-|  |
-| ------- |
-| [0315-count-of-smaller-numbers-after-self](https://github.com/hogan-tech/leetcode-solution/tree/master/0315-count-of-smaller-numbers-after-self) |
-## Segment Tree
-|  |
-| ------- |
-| [0315-count-of-smaller-numbers-after-self](https://github.com/hogan-tech/leetcode-solution/tree/master/0315-count-of-smaller-numbers-after-self) |
-## Merge Sort
-|  |
-| ------- |
-| [0315-count-of-smaller-numbers-after-self](https://github.com/hogan-tech/leetcode-solution/tree/master/0315-count-of-smaller-numbers-after-self) |
-## Ordered Set
-|  |
-| ------- |
-| [0315-count-of-smaller-numbers-after-self](https://github.com/hogan-tech/leetcode-solution/tree/master/0315-count-of-smaller-numbers-after-self) |
-## Dynamic Programming
-|  |
-| ------- |
-| [1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array](https://github.com/hogan-tech/leetcode-solution/tree/master/1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array) |
-## Stack
-|  |
-| ------- |
-| [1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array](https://github.com/hogan-tech/leetcode-solution/tree/master/1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array) |
-## Greedy
-|  |
-| ------- |
-| [1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array](https://github.com/hogan-tech/leetcode-solution/tree/master/1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array) |
-## Monotonic Stack
-|  |
-| ------- |
-| [1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array](https://github.com/hogan-tech/leetcode-solution/tree/master/1633-minimum-number-of-increments-on-subarrays-to-form-a-target-array) |
-<!---LeetCode Topics End-->