solves sum of square of numbers

Author: anishLearnsToCode

Diff for: README.md

@@ -164,7 +164,7 @@
 | 617 | [Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees) | [![Java](assets/java.png)](src/MergeTwoBinaryTrees.java) [![Python](assets/python.png)](python/merge_two_binary_trees.py) |
 | 624 | 🔒 [Maximum Distance in Arrays](https://leetcode.com/problems/maximum-distance-in-arrays) | |
 | 628 | [Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers) | [![Java](assets/java.png)](src/MaximumProductOfThreeNumbers.java) [![Python](assets/python.png)](python/maximum_product_of_three_numbers.py) |
-| 633 | [Sum Square Numbers](https://leetcode.com/problems/sum-of-square-numbers) | |
+| 633 | [Sum Square Numbers](https://leetcode.com/problems/sum-of-square-numbers) | [![Java](assets/java.png)](src/SumOfSquareNumbers.java) [![Python](assets/python.png)](python/sum_of_squares_numbers.py) |
 | 637 | [Average of Levels in Binary Tree](https://leetcode.com/problems/average-of-levels-in-binary-tree) | |
 | 643 | [Maximum Average SubArray I](https://leetcode.com/problems/maximum-average-subarray-i) | |
 | 645 | [Set Mismatch](https://leetcode.com/problems/set-mismatch) | |

Diff for: python/sum_of_squares_numbers.py

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

Diff for: src/SumOfSquareNumbers.java

@@ -0,0 +1,16 @@
+public class SumOfSquareNumbers {
+    public boolean judgeSquareSum(int c) {
+        int count;
+        for (int i = 2 ; i * i <= c ; i++) {
+            if (c % i == 0) {
+                count = 0;
+                while (c % i == 0) {
+                    c /= i;
+                    count++;
+                }
+                if (i % 4 == 3 && count % 2 == 1) return false;
+            }
+        }
+        return true;
+    }
+}