update readme

Author: hogan-tech

.github/test.txt

@@ -1 +1 @@
-2048-next-greater-numerically-balanced-number python medium
+2464-minimum-subarrays-in-a-valid-split python medium

2607-minimum-subarrays-in-a-valid-split/2607-minimum-subarrays-in-a-valid-split.py renamed to Python/2464-minimum-subarrays-in-a-valid-split.py

@@ -198,6 +198,7 @@
 | 2461 | [Maximum Sum of Distinct Subarrays With Length K](https://leetcode.com/problems/maximum-sum-of-distinct-subarrays-with-length-k)                                            | [Python](./Python/2461-maximum-sum-of-distinct-subarrays-with-length-k.py)                      | [Medium](./Readme/2461-maximum-sum-of-distinct-subarrays-with-length-k.md)                      |
 | 2462 | [Total Cost to Hire K Workers](https://leetcode.com/problems/total-cost-to-hire-k-workers/)                                                                                 | [Python](./Python/2462-total-cost-to-hire-k-workers.py)                                         | [Medium](./Readme/2462-total-cost-to-hire-k-workers.md)                                         |
 | 2463 | [Minimum Total Distance Traveled](https://leetcode.com/problems/minimum-total-distance-traveled)                                                                            | [Python](./Python/2463-minimum-total-distance-traveled.py)                                      | [Hard](./Readme/2463-minimum-total-distance-traveled.md)                                        |
+| 2464 | [Minimum Subarrays in a Valid Split](https://leetcode.com/problems/minimum-subarrays-in-a-valid-split/)                                                                     | [Python](./Python/2464-minimum-subarrays-in-a-valid-split.py)                                   | [Medium](./Readme/2464-minimum-subarrays-in-a-valid-split.md)                                   |
 | 2466 | [Count Ways to Build Good Strings](https://leetcode.com/problems/count-ways-to-build-good-strings)                                                                          | [Python](./Python/2466-count-ways-to-build-good-strings.py)                                     | [Medium](./Readme/2466-count-ways-to-build-good-strings.md)                                     |
 | 2467 | [Most Profitable Path in a Tree](https://leetcode.com/problems/most-profitable-path-in-a-tree)                                                                              | [Python](./Python/2467-most-profitable-path-in-a-tree.py)                                       | [Medium](./Readme/2467-most-profitable-path-in-a-tree.md)                                       |
 | 2470 | [Number of Subarrays With LCM Equal to K](https://leetcode.com/problems/number-of-subarrays-with-lcm-equal-to-k)                                                            | [Python](./Python/2470-number-of-subarrays-with-lcm-equal-to-k.py)                              | [Medium](./Readme/2470-number-of-subarrays-with-lcm-equal-to-k.md)                              |

Question_List_2001_3000.md

@@ -115,23 +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
-|  |
-| ------- |
-| [2607-minimum-subarrays-in-a-valid-split](https://github.com/hogan-tech/leetcode-solution/tree/master/2607-minimum-subarrays-in-a-valid-split) |
-## Math
-|  |
-| ------- |
-| [2607-minimum-subarrays-in-a-valid-split](https://github.com/hogan-tech/leetcode-solution/tree/master/2607-minimum-subarrays-in-a-valid-split) |
-## Dynamic Programming
-|  |
-| ------- |
-| [2607-minimum-subarrays-in-a-valid-split](https://github.com/hogan-tech/leetcode-solution/tree/master/2607-minimum-subarrays-in-a-valid-split) |
-## Number Theory
-|  |
-| ------- |
-| [2607-minimum-subarrays-in-a-valid-split](https://github.com/hogan-tech/leetcode-solution/tree/master/2607-minimum-subarrays-in-a-valid-split) |
-<!---LeetCode Topics End-->