update readme

Author: hogan-tech

.github/test.txt

@@ -1,3 +1,2 @@
-3765-complete-prime-number python medium
-3766-minimum-operations-to-make-binary-palindrome python medium
-3767-maximize-points-after-choosing-k-tasks python medium
+1874-minimize-product-sum-of-two-arrays python medium
+1925-count-square-sum-triples python easy

…74-minimize-product-sum-of-two-arrays.py …74-minimize-product-sum-of-two-arrays.py1874-minimize-product-sum-of-two-arrays/1874-minimize-product-sum-of-two-arrays.py renamed to Python/1874-minimize-product-sum-of-two-arrays.py 1874-minimize-product-sum-of-two-arrays/1874-minimize-product-sum-of-two-arrays.py renamed to Python/1874-minimize-product-sum-of-two-arrays.py

@@ -382,6 +382,7 @@
 | 1863 | [Sum of All Subset XOR Totals](https://leetcode.com/problems/sum-of-all-subset-xor-totals/)                                                                                                  | [Python](./Python/1863-sum-of-all-subset-xor-totals.py)                                                  | [Easy](./Readme/1863-sum-of-all-subset-xor-totals.md)                                                    |
 | 1865 | [Finding Pairs With a Certain Sum](https://leetcode.com/problems/finding-pairs-with-a-certain-sum/)                                                                                          | [Python](./Python/1865-finding-pairs-with-a-certain-sum.py)                                              | [Medium](./Readme/1865-finding-pairs-with-a-certain-sum.md)                                              |
 | 1870 | [Minimum Speed to Arrive on Time](https://leetcode.com/problems/minimum-speed-to-arrive-on-time/)                                                                                            | [Python](./Python/1870-minimum-speed-to-arrive-on-time.py)                                               | [Medium](./Readme/1870-minimum-speed-to-arrive-on-time.md)                                               |
+| 1874 | [Minimize Product Sum of Two Arrays](https://leetcode.com/problems/minimize-product-sum-of-two-arrays/)                                                                                      | [Python](./Python/1874-minimize-product-sum-of-two-arrays.py)                                            | [Medium](./Readme/1874-minimize-product-sum-of-two-arrays.md)                                            |
 | 1877 | [Minimize Maximum Pair Sum in Array](https://leetcode.com/problems/minimize-maximum-pair-sum-in-array/)                                                                                      | [Python](./Python/1877-minimize-maximum-pair-sum-in-array.py)                                            | [Medium](./Readme/1877-minimize-maximum-pair-sum-in-array.md)                                            |
 | 1881 | [Maximum Value After Insertion](https://leetcode.com/problems/maximum-value-after-insertion)                                                                                                 | [Python](./Python/1881-maximum-value-after-insertion.py)                                                 | [Medium](./Readme/1881-maximum-value-after-insertion.md)                                                 |
 | 1885 | [Count Pairs in Two Arrays](https://leetcode.com/problems/count-pairs-in-two-arrays/)                                                                                                        | [Python](./Python/1885-count-pairs-in-two-arrays.py)                                                     | [Medium](./Readme/1885-count-pairs-in-two-arrays.md)                                                     |
@@ -403,6 +404,7 @@
 | 1920 | [Build Array from Permutation](https://leetcode.com/problems/build-array-from-permutation/)                                                                                                  | [Python](./C++/1920-build-array-from-permutation.py), [C++](./C++/1920-build-array-from-permutation.cpp) | [Easy](./Readme/1920-build-array-from-permutation.md)                                                    |
 | 1921 | [Eliminate Maximum Number of Monsters](https://leetcode.com/problems/eliminate-maximum-number-of-monsters/)                                                                                  | [Python](./Python/1921-eliminate-maximum-number-of-monsters.py)                                          | [Medium](./Readme/1921-eliminate-maximum-number-of-monsters.md)                                          |
 | 1922 | [Count Good Numbers](https://leetcode.com/problems/count-good-numbers)                                                                                                                       | [Python](./Python/1922-count-good-numbers.py)                                                            | [Medium](./Readme/1922-count-good-numbers.md)                                                            |
+| 1925 | [Count Square Sum Triples](https://leetcode.com/problems/count-square-sum-triples/)                                                                                                          | [Python](./Python/1925-count-square-sum-triples.py)                                                      | [Easy](./Readme/1925-count-square-sum-triples.md)                                                        |
 | 1926 | [Nearest Exit from Entrance in Maze](https://leetcode.com/problems/nearest-exit-from-entrance-in-maze/)                                                                                      | [Python](./Python/1926-nearest-exit-from-entrance-in-maze.py)                                            | [Medium](./Readme/1926-nearest-exit-from-entrance-in-maze.md)                                            |
 | 1929 | [Concatenation of Array](https://leetcode.com/problems/concatenation-of-array/)                                                                                                              | [Python](./Python/1929-concatenation-of-array.py)                                                        | [Easy](./Readme/1929-concatenation-of-array.md)                                                          |
 | 1930 | [Unique Length-3 Palindromic Subsequences](https://leetcode.com/problems/unique-length-3-palindromic-subsequences/)                                                                          | [Python](./Python/1930-unique-length-3-palindromic-subsequences.py)                                      | [Medium](./Readme/1930-unique-length-3-palindromic-subsequences.md)                                      |

…triples/1925-count-square-sum-triples.py Python/1925-count-square-sum-triples.py1925-count-square-sum-triples/1925-count-square-sum-triples.py renamed to Python/1925-count-square-sum-triples.py 1925-count-square-sum-triples/1925-count-square-sum-triples.py renamed to Python/1925-count-square-sum-triples.py

@@ -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
-|  |
-| ------- |
-| [1874-minimize-product-sum-of-two-arrays](https://github.com/hogan-tech/leetcode-solution/tree/master/1874-minimize-product-sum-of-two-arrays) |
-## Greedy
-|  |
-| ------- |
-| [1874-minimize-product-sum-of-two-arrays](https://github.com/hogan-tech/leetcode-solution/tree/master/1874-minimize-product-sum-of-two-arrays) |
-## Sorting
-|  |
-| ------- |
-| [1874-minimize-product-sum-of-two-arrays](https://github.com/hogan-tech/leetcode-solution/tree/master/1874-minimize-product-sum-of-two-arrays) |
-## Math
-|  |
-| ------- |
-| [1925-count-square-sum-triples](https://github.com/hogan-tech/leetcode-solution/tree/master/1925-count-square-sum-triples) |
-## Enumeration
-|  |
-| ------- |
-| [1925-count-square-sum-triples](https://github.com/hogan-tech/leetcode-solution/tree/master/1925-count-square-sum-triples) |
-<!---LeetCode Topics End-->