@Solution: Sum of Square Numbers

Author: i-redbyte

medium/sum of square numbers/README.md

@@ -0,0 +1,23 @@
+# Sum of Square Numbers
+
+Given a non-negative integer c, decide whether there're two integers a and b such that a2 + b2 = c.
+
+Example 1:
+
+```
+Input: c = 5
+Output: true
+Explanation: 1 * 1 + 2 * 2 = 5
+```
+
+Example 2:
+
+```
+Input: c = 3
+Output: false
+```
+
+**Constraints:**
+- 0 <= c <= 2^31 - 1
+
+[Link](https://leetcode.com/problems/sum-of-square-numbers/description/?envType=daily-question&envId=2024-06-17)

medium/sum of square numbers/solution.py

@@ -0,0 +1,21 @@
+
+class Solution:
+    def judgeSquareSum(self, c: int) -> bool:
+        i = 2
+        while i * i <= c:
+            count = 0
+            if c % i == 0:
+                while c % i == 0:
+                    count += 1
+                    c /= i
+                if i % 4 == 3 and count % 2 != 0:
+                    return False
+            i += 1
+        return c % 4 != 3
+
+
+s = Solution()
+print(s.judgeSquareSum(5))
+print(s.judgeSquareSum(3))
+print(s.judgeSquareSum(6))
+print(s.judgeSquareSum(8))