update readme

Author: hogan-tech

.github/test.txt

@@ -1 +1 @@
-2011-final-value-of-variable-after-performing-operations python easy
+3346-maximum-frequency-of-an-element-after-performing-operations-i python medium

3622-maximum-frequency-of-an-element-after-performing-operations-i/3622-maximum-frequency-of-an-element-after-performing-operations-i.py renamed to Python/3346-maximum-frequency-of-an-element-after-performing-operations-i.py

@@ -108,6 +108,7 @@
 | 3342 | [Find Minimum Time to Reach Last Room II](https://leetcode.com/problems/find-minimum-time-to-reach-last-room-ii)                                                       | [Python](./Python/3342-find-minimum-time-to-reach-last-room-ii.py)                            | [Medium](./Readme/3342-find-minimum-time-to-reach-last-room-ii.md)                            |
 | 3343 | [Count Number of Balanced Permutations](https://leetcode.com/problems/count-number-of-balanced-permutations)                                                           | [Python](./Python/3343-count-number-of-balanced-permutations.py)                              | [Hard](./Readme/3343-count-number-of-balanced-permutations.md)                                |
 | 3345 | [Smallest Divisible Digit Product I](https://leetcode.com/problems/smallest-divisible-digit-product-i)                                                                 | [Python](./Python/3345-smallest-divisible-digit-product-i.py)                                 | [Easy](./Readme/3345-smallest-divisible-digit-product-i.md)                                   |
+| 3346 | [Maximum Frequency of an Element After Performing Operations I](https://leetcode.com/problems/maximum-frequency-of-an-element-after-performing-operations-i)           | [Python](./Python/3346-maximum-frequency-of-an-element-after-performing-operations-i.py)      | [Medium](./Readme/3346-maximum-frequency-of-an-element-after-performing-operations-i.md)      |
 | 3349 | [Adjacent Increasing Subarrays Detection I](https://leetcode.com/problems/adjacent-increasing-subarrays-detection-i)                                                   | [Python](./Python/3349-adjacent-increasing-subarrays-detection-i.py)                          | [Easy](./Readme/3349-adjacent-increasing-subarrays-detection-i.md)                            |
 | 3350 | [Adjacent Increasing Subarrays Detection II](https://leetcode.com/problems/adjacent-increasing-subarrays-detection-ii)                                                 | [Python](./Python/3350-adjacent-increasing-subarrays-detection-ii.py)                         | [Medium](./Readme/3350-adjacent-increasing-subarrays-detection-ii.md)                         |
 | 3354 | [Make Array Elements Equal to Zero](https://leetcode.com/problems/make-array-elements-equal-to-zero)                                                                   | [Python](./Python/3354-make-array-elements-equal-to-zero.py)                                  | [Easy](./Readme/3354-make-array-elements-equal-to-zero.md)                                    |

Question_List_3001_4000.md

@@ -115,27 +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
-|  |
-| ------- |
-| [3622-maximum-frequency-of-an-element-after-performing-operations-i](https://github.com/hogan-tech/leetcode-solution/tree/master/3622-maximum-frequency-of-an-element-after-performing-operations-i) |
-## Binary Search
-|  |
-| ------- |
-| [3622-maximum-frequency-of-an-element-after-performing-operations-i](https://github.com/hogan-tech/leetcode-solution/tree/master/3622-maximum-frequency-of-an-element-after-performing-operations-i) |
-## Sliding Window
-|  |
-| ------- |
-| [3622-maximum-frequency-of-an-element-after-performing-operations-i](https://github.com/hogan-tech/leetcode-solution/tree/master/3622-maximum-frequency-of-an-element-after-performing-operations-i) |
-## Sorting
-|  |
-| ------- |
-| [3622-maximum-frequency-of-an-element-after-performing-operations-i](https://github.com/hogan-tech/leetcode-solution/tree/master/3622-maximum-frequency-of-an-element-after-performing-operations-i) |
-## Prefix Sum
-|  |
-| ------- |
-| [3622-maximum-frequency-of-an-element-after-performing-operations-i](https://github.com/hogan-tech/leetcode-solution/tree/master/3622-maximum-frequency-of-an-element-after-performing-operations-i) |
-<!---LeetCode Topics End-->