update readme

Author: hogan-tech

.github/test.txt

@@ -1,3 +1,3 @@
-3750-minimum-number-of-flips-to-reverse-binary-string python easy
-3751-total-waviness-of-numbers-in-range-i python medium
-3752-lexicographically-smallest-negated-permutation-that-sums-to-target python medium
+3190-find-minimum-operations-to-make-all-elements-divisible-by-three python easy
+1262-greatest-sum-divisible-by-three python medium
+1018-binary-prefix-divisible-by-5 python easy

1018-binary-prefix-divisible-by-5/1018-binary-prefix-divisible-by-5.py renamed to Python/1018-binary-prefix-divisible-by-5.py

@@ -10,6 +10,7 @@
 | 1010 | [Pairs of Songs With Total Durations Divisible by 60](https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60/)                                                    | [Python](./Python/1010-pairs-of-songs-with-total-durations-divisible-by-60.py)                           | [Medium](./Readme/1010-pairs-of-songs-with-total-durations-divisible-by-60.md)                           |
 | 1011 | [Capacity To Ship Packages Within D Days](https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/)                                                                            | [Python](./Python/1011-capacity-to-ship-packages-within-d-days.py)                                       | [Medium](./Readme/1011-capacity-to-ship-packages-within-d-days.md)                                       |
 | 1014 | [Best Sightseeing Pair](https://leetcode.com/problems/best-sightseeing-pair)                                                                                                                 | [Python](./Python/1014-best-sightseeing-pair.py)                                                         | [Medium](./Readme/1014-best-sightseeing-pair.md)                                                         |
+| 1018 | [Binary Prefix Divisible By 5](https://leetcode.com/problems/binary-prefix-divisible-by-5)                                                                                                   | [Python](./Python/1018-binary-prefix-divisible-by-5.py)                                                  | [Easy](./Readme/1018-binary-prefix-divisible-by-5.md)                                                    |
 | 1019 | [Next Greater Node In Linked List](https://leetcode.com/problems/next-greater-node-in-linked-list)                                                                                           | [Python](./Python/1019-next-greater-node-in-linked-list.py)                                              | [Medium](./Readme/1019-next-greater-node-in-linked-list.md)                                              |
 | 1023 | [Camelcase Matching](https://leetcode.com/problems/camelcase-matching)                                                                                                                       | [Python](./Python/1023-camelcase-matching.py)                                                            | [Medium](./Readme/1023-camelcase-matching.md)                                                            |
 | 1026 | [Maximum Difference Between Node and Ancestor](https://leetcode.com/problems/maximum-difference-between-node-and-ancestor/)                                                                  | [Python](./Python/1026-maximum-difference-between-node-and-ancestor.py)                                  | [Medium](./Readme/1026-maximum-difference-between-node-and-ancestor.md)                                  |
@@ -118,6 +119,7 @@
 | 1256 | [Encode Number](https://leetcode.com/problems/encode-number/)                                                                                                                                | [Python](./Python/1256-encode-number.py)                                                                 | [Medium](./Readme/1256-encode-number.md)                                                                 |
 | 1257 | [Smallest Common Region](https://leetcode.com/problems/smallest-common-region/)                                                                                                              | [Python](./Python/1257-smallest-common-region.py)                                                        | [Medium](./Readme/1257-smallest-common-region.md)                                                        |
 | 1261 | [Find Elements in a Contaminated Binary Tree](https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree)                                                                     | [Python](./Python/1261-find-elements-in-a-contaminated-binary-tree.py)                                   | [Medium](./Readme/1261-find-elements-in-a-contaminated-binary-tree.md)                                   |
+| 1262 | [Greatest Sum Divisible by Three](https://leetcode.com/problems/greatest-sum-divisible-by-three/)                                                                                            | [Python](./Python/1262-greatest-sum-divisible-by-three.py)                                               | [Medium](./Readme/1262-greatest-sum-divisible-by-three.md)                                               |
 | 1265 | [Print Immutable Linked List in Reverse](https://leetcode.com/problems/print-immutable-linked-list-in-reverse/)                                                                              | [C++](./C++/1265-print-immutable-linked-list-in-reverse.cpp)                                             | [Medium](./Readme/1265-print-immutable-linked-list-in-reverse.md)                                        |
 | 1266 | [Minimum Time Visiting All Points](https://leetcode.com/problems/minimum-time-visiting-all-points/)                                                                                          | [Python](./Python/1266-minimum-time-visiting-all-points.py)                                              | [Easy](./Readme/1266-minimum-time-visiting-all-points.md)                                                |
 | 1267 | [Count Servers that Communicate](https://leetcode.com/problems/count-servers-that-communicate)                                                                                               | [Python](./Python/1267-count-servers-that-communicate.py)                                                | [Medium](./Readme/1267-count-servers-that-communicate.md)                                                |

1262-greatest-sum-divisible-by-three/1262-greatest-sum-divisible-by-three.py renamed to Python/1262-greatest-sum-divisible-by-three.py

@@ -54,6 +54,7 @@
 | 3179 | [Find the N-th Value After K Seconds](https://leetcode.com/problems/find-the-n-th-value-after-k-seconds)                                                               | [Python](./Python/3179-find-the-n-th-value-after-k-seconds.py)                                | [Medium](./Readme/3179-find-the-n-th-value-after-k-seconds.md)                                |
 | 3186 | [Maximum Total Damage with Spell Casting](https://leetcode.com/problems/maximum-total-damage-with-spell-casting/)                                                      | [Python](./Python/3186-maximum-total-damage-with-spell-casting.py)                            | [Medium](./Readme/3186-maximum-total-damage-with-spell-casting.md)                            |
 | 3189 | [Minimum Moves to Get a Peaceful Board](https://leetcode.com/problems/minimum-moves-to-get-a-peaceful-board/)                                                          | [Python](./Python/3189-minimum-moves-to-get-a-peaceful-board.py)                              | [Medium](./Readme/3189-minimum-moves-to-get-a-peaceful-board.md)                              |
+| 3190 | [Minimum Operations to Make All Elements Divisible by Three](https://leetcode.com/problems/minimum-operations-to-make-all-elements-divisible-by-three)                 | [Python](./Python/3190-minimum-operations-to-make-all-elements-divisible-by-three.py)         | [Easy](./Readme/3190-minimum-operations-to-make-all-elements-divisible-by-three.md)           |
 | 3191 | [Minimum Operations to Make Binary Array Elements Equal to One I](https://leetcode.com/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-i)       | [Python](./Python/3191-minimum-operations-to-make-binary-array-elements-equal-to-one-i.py)    | [Medium](./Readme/3191-minimum-operations-to-make-binary-array-elements-equal-to-one-i.md)    |
 | 3192 | [Minimum Operations to Make Binary Array Elements Equal to One II](https://leetcode.com/problems/minimum-operations-to-make-binary-array-elements-equal-to-one-ii)     | [Python](./Python/3192-minimum-operations-to-make-binary-array-elements-equal-to-one-ii.py)   | [Medium](./Readme/3192-minimum-operations-to-make-binary-array-elements-equal-to-one-ii.md)   |
 | 3195 | [Find the Minimum Area to Cover All Ones I](https://leetcode.com/problems/find-the-minimum-area-to-cover-all-ones-i)                                                   | [Python](./Python/3195-find-the-minimum-area-to-cover-all-ones-i.py)                          | [Medium](./Readme/3195-find-the-minimum-area-to-cover-all-ones-i.md)                          |

3190-find-minimum-operations-to-make-all-elements-divisible-by-three/3190-find-minimum-operations-to-make-all-elements-divisible-by-three.py renamed to Python/3190-find-minimum-operations-to-make-all-elements-divisible-by-three.py

@@ -115,33 +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
-|  |
-| ------- |
-| [1018-binary-prefix-divisible-by-5](https://github.com/hogan-tech/leetcode-solution/tree/master/1018-binary-prefix-divisible-by-5) |
-| [1262-greatest-sum-divisible-by-three](https://github.com/hogan-tech/leetcode-solution/tree/master/1262-greatest-sum-divisible-by-three) |
-| [3190-find-minimum-operations-to-make-all-elements-divisible-by-three](https://github.com/hogan-tech/leetcode-solution/tree/master/3190-find-minimum-operations-to-make-all-elements-divisible-by-three) |
-## Math
-|  |
-| ------- |
-| [3190-find-minimum-operations-to-make-all-elements-divisible-by-three](https://github.com/hogan-tech/leetcode-solution/tree/master/3190-find-minimum-operations-to-make-all-elements-divisible-by-three) |
-## Dynamic Programming
-|  |
-| ------- |
-| [1262-greatest-sum-divisible-by-three](https://github.com/hogan-tech/leetcode-solution/tree/master/1262-greatest-sum-divisible-by-three) |
-## Greedy
-|  |
-| ------- |
-| [1262-greatest-sum-divisible-by-three](https://github.com/hogan-tech/leetcode-solution/tree/master/1262-greatest-sum-divisible-by-three) |
-## Sorting
-|  |
-| ------- |
-| [1262-greatest-sum-divisible-by-three](https://github.com/hogan-tech/leetcode-solution/tree/master/1262-greatest-sum-divisible-by-three) |
-## Bit Manipulation
-|  |
-| ------- |
-| [1018-binary-prefix-divisible-by-5](https://github.com/hogan-tech/leetcode-solution/tree/master/1018-binary-prefix-divisible-by-5) |
-<!---LeetCode Topics End-->