update readme

Author: hogan-tech

.github/test.txt

@@ -1 +1 @@
-3346-maximum-frequency-of-an-element-after-performing-operations-i python medium
+3347-maximum-frequency-of-an-element-after-performing-operations-ii python hard

1713-dot-product-of-two-sparse-vectors/1713-dot-product-of-two-sparse-vectors.py

@@ -109,6 +109,7 @@
 | 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)      |
+| 3347 | [Maximum Frequency of an Element After Performing Operations II](https://leetcode.com/problems/maximum-frequency-of-an-element-after-performing-operations-ii)         | [Python](./Python/3347-maximum-frequency-of-an-element-after-performing-operations-ii.py)     | [Hard](./Readme/3347-maximum-frequency-of-an-element-after-performing-operations-ii.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)                                    |

1713-dot-product-of-two-sparse-vectors/README.md

@@ -115,40 +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
-|  |
-| ------- |
-| [1713-dot-product-of-two-sparse-vectors](https://github.com/hogan-tech/leetcode-solution/tree/master/1713-dot-product-of-two-sparse-vectors) |
-| [3640-maximum-frequency-of-an-element-after-performing-operations-ii](https://github.com/hogan-tech/leetcode-solution/tree/master/3640-maximum-frequency-of-an-element-after-performing-operations-ii) |
-## Hash Table
-|  |
-| ------- |
-| [1713-dot-product-of-two-sparse-vectors](https://github.com/hogan-tech/leetcode-solution/tree/master/1713-dot-product-of-two-sparse-vectors) |
-## Two Pointers
-|  |
-| ------- |
-| [1713-dot-product-of-two-sparse-vectors](https://github.com/hogan-tech/leetcode-solution/tree/master/1713-dot-product-of-two-sparse-vectors) |
-## Design
-|  |
-| ------- |
-| [1713-dot-product-of-two-sparse-vectors](https://github.com/hogan-tech/leetcode-solution/tree/master/1713-dot-product-of-two-sparse-vectors) |
-## Binary Search
-|  |
-| ------- |
-| [3640-maximum-frequency-of-an-element-after-performing-operations-ii](https://github.com/hogan-tech/leetcode-solution/tree/master/3640-maximum-frequency-of-an-element-after-performing-operations-ii) |
-## Sliding Window
-|  |
-| ------- |
-| [3640-maximum-frequency-of-an-element-after-performing-operations-ii](https://github.com/hogan-tech/leetcode-solution/tree/master/3640-maximum-frequency-of-an-element-after-performing-operations-ii) |
-## Sorting
-|  |
-| ------- |
-| [3640-maximum-frequency-of-an-element-after-performing-operations-ii](https://github.com/hogan-tech/leetcode-solution/tree/master/3640-maximum-frequency-of-an-element-after-performing-operations-ii) |
-## Prefix Sum
-|  |
-| ------- |
-| [3640-maximum-frequency-of-an-element-after-performing-operations-ii](https://github.com/hogan-tech/leetcode-solution/tree/master/3640-maximum-frequency-of-an-element-after-performing-operations-ii) |
-<!---LeetCode Topics End-->