We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 8271e1c commit bcfb50eCopy full SHA for bcfb50e
README.md
@@ -130,4 +130,12 @@ Feedback / Questions → open an Issue or reach out on [LinkedIn](https://www.li
130
| |
131
| ------- |
132
| [1874-minimize-product-sum-of-two-arrays](https://github.com/hogan-tech/leetcode-solution/tree/master/1874-minimize-product-sum-of-two-arrays) |
133
+## Math
134
+| |
135
+| ------- |
136
+| [1925-count-square-sum-triples](https://github.com/hogan-tech/leetcode-solution/tree/master/1925-count-square-sum-triples) |
137
+## Enumeration
138
139
140
141
<!---LeetCode Topics End-->
0 commit comments