update readme

Author: hogan-tech

.github/test.txt

@@ -1 +1 @@
-3347-maximum-frequency-of-an-element-after-performing-operations-ii python hard
+2048-next-greater-numerically-balanced-number python medium

0234-palindrome-linked-list/0234-palindrome-linked-list.py

@@ -21,6 +21,7 @@
 | 2043 | [Simple Bank System](https://leetcode.com/problems/simple-bank-system)                                                                                                      | [Python](./Python/2043-simple-bank-system.py)                                                   | [Medium](./Readme/2043-simple-bank-system.md)                                                   |
 | 2044 | [Count Number of Maximum Bitwise OR Subsets](https://leetcode.com/problems/count-number-of-maximum-bitwise-or-subsets)                                                      | [Python](./Python/2044-count-number-of-maximum-bitwise-or-subsets.py)                           | [Medium](./Readme/2044-count-number-of-maximum-bitwise-or-subsets.md)                           |
 | 2045 | [Second Minimum Time to Reach Destination](https://leetcode.com/problems/second-minimum-time-to-reach-destination/)                                                         | [Python](./Python/2045-second-minimum-time-to-reach-destination.py)                             | [Hard](./Readme/2045-second-minimum-time-to-reach-destination.md)                               |
+| 2048 | [Next Greater Numerically Balanced Number](https://leetcode.com/problems/next-greater-numerically-balanced-number/)                                                         | [Python](./Python/2048-next-greater-numerically-balanced-number.py)                             | [Medium](./Readme/2048-next-greater-numerically-balanced-number.md)                             |
 | 2050 | [Number of Different Integers in a String](https://leetcode.com/problems/number-of-different-integers-in-a-string/)                                                         | [Python](./Python/2050-number-of-different-integers-in-a-string.py)                             | [Easy](./Readme/2050-number-of-different-integers-in-a-string.md)                               |
 | 2053 | [Kth Distinct String in an Array](https://leetcode.com/problems/kth-distinct-string-in-an-array/)                                                                           | [Python](./Python/2053-kth-distinct-string-in-an-array.py)                                      | [Easy](./Readme/2053-kth-distinct-string-in-an-array.md)                                        |
 | 2054 | [Two Best Non-Overlapping Events](https://leetcode.com/problems/two-best-non-overlapping-events)                                                                            | [Python](./Python/2054-two-best-non-overlapping-events.py)                                      | [Medium](./Readme/2054-two-best-non-overlapping-events.md)                                      |

3768-check-if-digits-are-equal-in-string-after-operations-i/3768-check-if-digits-are-equal-in-string-after-operations-i.py

@@ -115,60 +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
-## Math
-|  |
-| ------- |
-| [2174-next-greater-numerically-balanced-number](https://github.com/hogan-tech/leetcode-solution/tree/master/2174-next-greater-numerically-balanced-number) |
-| [3768-check-if-digits-are-equal-in-string-after-operations-i](https://github.com/hogan-tech/leetcode-solution/tree/master/3768-check-if-digits-are-equal-in-string-after-operations-i) |
-## String
-|  |
-| ------- |
-| [3768-check-if-digits-are-equal-in-string-after-operations-i](https://github.com/hogan-tech/leetcode-solution/tree/master/3768-check-if-digits-are-equal-in-string-after-operations-i) |
-## Simulation
-|  |
-| ------- |
-| [3768-check-if-digits-are-equal-in-string-after-operations-i](https://github.com/hogan-tech/leetcode-solution/tree/master/3768-check-if-digits-are-equal-in-string-after-operations-i) |
-## Combinatorics
-|  |
-| ------- |
-| [3768-check-if-digits-are-equal-in-string-after-operations-i](https://github.com/hogan-tech/leetcode-solution/tree/master/3768-check-if-digits-are-equal-in-string-after-operations-i) |
-## Number Theory
-|  |
-| ------- |
-| [3768-check-if-digits-are-equal-in-string-after-operations-i](https://github.com/hogan-tech/leetcode-solution/tree/master/3768-check-if-digits-are-equal-in-string-after-operations-i) |
-## Linked List
-|  |
-| ------- |
-| [0234-palindrome-linked-list](https://github.com/hogan-tech/leetcode-solution/tree/master/0234-palindrome-linked-list) |
-## Two Pointers
-|  |
-| ------- |
-| [0234-palindrome-linked-list](https://github.com/hogan-tech/leetcode-solution/tree/master/0234-palindrome-linked-list) |
-## Stack
-|  |
-| ------- |
-| [0234-palindrome-linked-list](https://github.com/hogan-tech/leetcode-solution/tree/master/0234-palindrome-linked-list) |
-## Recursion
-|  |
-| ------- |
-| [0234-palindrome-linked-list](https://github.com/hogan-tech/leetcode-solution/tree/master/0234-palindrome-linked-list) |
-## Hash Table
-|  |
-| ------- |
-| [2174-next-greater-numerically-balanced-number](https://github.com/hogan-tech/leetcode-solution/tree/master/2174-next-greater-numerically-balanced-number) |
-## Backtracking
-|  |
-| ------- |
-| [2174-next-greater-numerically-balanced-number](https://github.com/hogan-tech/leetcode-solution/tree/master/2174-next-greater-numerically-balanced-number) |
-## Counting
-|  |
-| ------- |
-| [2174-next-greater-numerically-balanced-number](https://github.com/hogan-tech/leetcode-solution/tree/master/2174-next-greater-numerically-balanced-number) |
-## Enumeration
-|  |
-| ------- |
-| [2174-next-greater-numerically-balanced-number](https://github.com/hogan-tech/leetcode-solution/tree/master/2174-next-greater-numerically-balanced-number) |
-<!---LeetCode Topics End-->