update readme

Author: hogan-tech

.github/test.txt

@@ -1 +1 @@
-1015-smallest-integer-divisible-by-k python medium
+2435-paths-in-matrix-whose-sum-is-divisible-by-k python hard

2435-paths-in-matrix-whose-sum-is-divisible-by-k/2435-paths-in-matrix-whose-sum-is-divisible-by-k.py renamed to Python/2435-paths-in-matrix-whose-sum-is-divisible-by-k.py

@@ -187,6 +187,7 @@
 | 2429 | [Minimize XOR](https://leetcode.com/problems/minimize-xor)                                                                                                                  | [Python](./Python/2429-minimize-xor.py)                                                         | [Medium](./Readme/2429-minimize-xor.md)                                                         |
 | 2433 | [Find the Original Array of Prefix XOR](https://leetcode.com/problems/find-the-original-array-of-prefix-xor/)                                                               | [Python](./Python/2433-find-the-original-array-of-prefix-xor.py)                                | [Medium](./Readme/2433-find-the-original-array-of-prefix-xor.md)                                |
 | 2434 | [Using a Robot to Print the Lexicographically Smallest String](https://leetcode.com/problems/using-a-robot-to-print-the-lexicographically-smallest-string)                  | [Python](./Python/2434-using-a-robot-to-print-the-lexicographically-smallest-string.py)         | [Medium](./Readme/2434-using-a-robot-to-print-the-lexicographically-smallest-string.md)         |
+| 2435 | [Paths in Matrix Whose Sum is Divisible by K](https://leetcode.com/problems/paths-in-matrix-whose-sum-is-divisible-by-k/)                                                   | [Python](./Python/2435-paths-in-matrix-whose-sum-is-divisible-by-k.py)                          | [Hard](./Readme/2435-paths-in-matrix-whose-sum-is-divisible-by-k.md)                            |
 | 2438 | [Range Product Queries of Powers](https://leetcode.com/problems/range-product-queries-of-powers)                                                                            | [Python](./Python/2438-range-product-queries-of-powers.py)                                      | [Medium](./Readme/2438-range-product-queries-of-powers.md)                                      |
 | 2439 | [Minimize Maximum of Array](https://leetcode.com/problems/minimize-maximum-of-array)                                                                                        | [Python](./Python/2439-minimize-maximum-of-array.py)                                            | [Medium](./Readme/2439-minimize-maximum-of-array.md)                                            |
 | 2441 | [Largest Positive Integer That Exists With Its Negative](https://leetcode.com/problems/largest-positive-integer-that-exists-with-its-negative/)                             | [Python](./Python/2441-largest-positive-integer-that-exists-with-its-negative.py)               | [Easy](./Readme/2441-largest-positive-integer-that-exists-with-its-negative.md)                 |

Question_List_2001_3000.md

@@ -115,19 +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
-|  |
-| ------- |
-| [2435-paths-in-matrix-whose-sum-is-divisible-by-k](https://github.com/hogan-tech/leetcode-solution/tree/master/2435-paths-in-matrix-whose-sum-is-divisible-by-k) |
-## Dynamic Programming
-|  |
-| ------- |
-| [2435-paths-in-matrix-whose-sum-is-divisible-by-k](https://github.com/hogan-tech/leetcode-solution/tree/master/2435-paths-in-matrix-whose-sum-is-divisible-by-k) |
-## Matrix
-|  |
-| ------- |
-| [2435-paths-in-matrix-whose-sum-is-divisible-by-k](https://github.com/hogan-tech/leetcode-solution/tree/master/2435-paths-in-matrix-whose-sum-is-divisible-by-k) |
-<!---LeetCode Topics End-->