update readme

Author: hogan-tech

.github/test.txt

@@ -1,3 +1 @@
-3774-absolute-difference-between-maximum-and-minimum-k-elements python easy
-3775-reverse-words-with-same-vowel-count python medium
-3776-minimum-moves-to-balance-circular-array python medium
+3562-maximum-profit-from-trading-stocks-with-discounts python hard

3573-best-time-to-buy-and-sell-stock-v/README.md

@@ -220,6 +220,7 @@
 | 3558 | [Number of Ways to Assign Edge Weights I](https://leetcode.com/problems/number-of-ways-to-assign-edge-weights-i)                                                       | [Python](./Python/3558-number-of-ways-to-assign-edge-weights-i.py)                            | [Medium](./Readme/3558-number-of-ways-to-assign-edge-weights-i.md)                            |
 | 3560 | [Find Minimum Log Transportation Cost](https://leetcode.com/problems/find-minimum-log-transportation-cost)                                                             | [Python](./Python/3560-find-minimum-log-transportation-cost.py)                               | [Easy](./Readme/3560-find-minimum-log-transportation-cost.md)                                 |
 | 3561 | [Resulting String After Adjacent Removals](https://leetcode.com/problems/resulting-string-after-adjacent-removals)                                                     | [Python](./Python/3561-resulting-string-after-adjacent-removals.py)                           | [Medium](./Readme/3561-resulting-string-after-adjacent-removals.md)                           |
+| 3562 | [Maximum Profit from Trading Stocks with Discounts](https://leetcode.com/problems/maximum-profit-from-trading-stocks-with-discounts)                                   | [Python](./Python/3562-maximum-profit-from-trading-stocks-with-discounts.py)                  | [Hard](./Readme/3562-maximum-profit-from-trading-stocks-with-discounts.md)                    |
 | 3566 | [Partition Array into Two Equal Product Subsets](https://leetcode.com/problems/partition-array-into-two-equal-product-subsets)                                         | [Python](./Python/3566-partition-array-into-two-equal-product-subsets.py)                     | [Medium](./Readme/3566-partition-array-into-two-equal-product-subsets.md)                     |
 | 3567 | [Minimum Moves to Clean the Classroom](https://leetcode.com/problems/minimum-moves-to-clean-the-classroom)                                                             | [Python](./Python/3567-minimum-moves-to-clean-the-classroom.py)                               | [Medium](./Readme/3567-minimum-moves-to-clean-the-classroom.md)                               |
 | 3568 | [Maximize Count of Distinct Primes After Split](https://leetcode.com/problems/maximize-count-of-distinct-primes-after-split)                                           | [Python](./Python/3568-maximize-count-of-distinct-primes-after-split.py)                      | [Medium](./Readme/3568-maximize-count-of-distinct-primes-after-split.md)                      |

…it-from-trading-stocks-with-discounts.py …it-from-trading-stocks-with-discounts.py3562-maximum-profit-from-trading-stocks-with-discounts/3562-maximum-profit-from-trading-stocks-with-discounts.py renamed to Python/3562-maximum-profit-from-trading-stocks-with-discounts.py 3562-maximum-profit-from-trading-stocks-with-discounts/3562-maximum-profit-from-trading-stocks-with-discounts.py renamed to Python/3562-maximum-profit-from-trading-stocks-with-discounts.py

@@ -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
-|  |
-| ------- |
-| [3562-maximum-profit-from-trading-stocks-with-discounts](https://github.com/hogan-tech/leetcode-solution/tree/master/3562-maximum-profit-from-trading-stocks-with-discounts) |
-## Dynamic Programming
-|  |
-| ------- |
-| [3562-maximum-profit-from-trading-stocks-with-discounts](https://github.com/hogan-tech/leetcode-solution/tree/master/3562-maximum-profit-from-trading-stocks-with-discounts) |
-## Tree
-|  |
-| ------- |
-| [3562-maximum-profit-from-trading-stocks-with-discounts](https://github.com/hogan-tech/leetcode-solution/tree/master/3562-maximum-profit-from-trading-stocks-with-discounts) |
-## Depth-First Search
-|  |
-| ------- |
-| [3562-maximum-profit-from-trading-stocks-with-discounts](https://github.com/hogan-tech/leetcode-solution/tree/master/3562-maximum-profit-from-trading-stocks-with-discounts) |
-<!---LeetCode Topics End-->