update readme

Author: hogan-tech

.github/test.txt

@@ -1 +1,2 @@
-3321-find-x-sum-of-all-k-long-subarrays-ii python hard
+3321-find-x-sum-of-all-k-long-subarrays-ii python hard
+2528-maximize-the-minimum-powered-city python hard

2618-maximize-the-minimum-powered-city/2618-maximize-the-minimum-powered-city.py renamed to Python/2528-maximize-the-minimum-powered-city.py

@@ -222,6 +222,7 @@
 | 2523 | [Closest Prime Numbers in Range](https://leetcode.com/problems/closest-prime-numbers-in-range)                                                                              | [Python](./Python/2523-closest-prime-numbers-in-range.py)                                       | [Medium](./Readme/2523-closest-prime-numbers-in-range.md)                                       |
 | 2526 | [Find Consecutive Integers from a Data Stream](https://leetcode.com/problems/find-consecutive-integers-from-a-data-stream)                                                  | [Python](./Python/2526-find-consecutive-integers-from-a-data-stream.py)                         | [Medium](./Readme/2526-find-consecutive-integers-from-a-data-stream.md)                         |
 | 2527 | [Find XOR Beauty of Array](https://leetcode.com/problems/find-xor-beauty-of-array)                                                                                          | [Python](./Python/2527-find-xor-beauty-of-array.py)                                             | [Medium](./Readme/2527-find-xor-beauty-of-array.md)                                             |
+| 2528 | [Maximize the Minimum Powered City](https://leetcode.com/problems/maximize-the-minimum-powered-city)                                                                        | [Python](./Python/2528-maximize-the-minimum-powered-city.py)                                    | [Hard](./Readme/2528-maximize-the-minimum-powered-city.md)                                      |
 | 2529 | [Maximum Count of Positive Integer and Negative Integer](https://leetcode.com/problems/maximum-count-of-positive-integer-and-negative-integer)                              | [Python](./Python/2529-maximum-count-of-positive-integer-and-negative-integer.py)               | [Easy](./Readme/2529-maximum-count-of-positive-integer-and-negative-integer.md)                 |
 | 2530 | [Maximal Score After Applying K Operations](https://leetcode.com/problems/maximal-score-after-applying-k-operations)                                                        | [Python](./Python/2530-maximal-score-after-applying-k-operations.py)                            | [Medium](./Readme/2530-maximal-score-after-applying-k-operations.md)                            |
 | 2537 | [Count the Number of Good Subarrays](https://leetcode.com/problems/count-the-number-of-good-subarrays)                                                                      | [Python](./Python/2537-count-the-number-of-good-subarrays.py)                                   | [Medium](./Readme/2537-count-the-number-of-good-subarrays.md)                                   |

Question_List_2001_3000.md

@@ -115,31 +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
-|  |
-| ------- |
-| [2618-maximize-the-minimum-powered-city](https://github.com/hogan-tech/leetcode-solution/tree/master/2618-maximize-the-minimum-powered-city) |
-## Binary Search
-|  |
-| ------- |
-| [2618-maximize-the-minimum-powered-city](https://github.com/hogan-tech/leetcode-solution/tree/master/2618-maximize-the-minimum-powered-city) |
-## Greedy
-|  |
-| ------- |
-| [2618-maximize-the-minimum-powered-city](https://github.com/hogan-tech/leetcode-solution/tree/master/2618-maximize-the-minimum-powered-city) |
-## Queue
-|  |
-| ------- |
-| [2618-maximize-the-minimum-powered-city](https://github.com/hogan-tech/leetcode-solution/tree/master/2618-maximize-the-minimum-powered-city) |
-## Sliding Window
-|  |
-| ------- |
-| [2618-maximize-the-minimum-powered-city](https://github.com/hogan-tech/leetcode-solution/tree/master/2618-maximize-the-minimum-powered-city) |
-## Prefix Sum
-|  |
-| ------- |
-| [2618-maximize-the-minimum-powered-city](https://github.com/hogan-tech/leetcode-solution/tree/master/2618-maximize-the-minimum-powered-city) |
-<!---LeetCode Topics End-->