Add solution #633

Author: JoshCrozier

README.md

@@ -477,6 +477,7 @@
 628|[Maximum Product of Three Numbers](./0628-maximum-product-of-three-numbers.js)|Easy|
 629|[K Inverse Pairs Array](./0629-k-inverse-pairs-array.js)|Hard|
 630|[Course Schedule III](./0630-course-schedule-iii.js)|Hard|
+633|[Sum of Square Numbers](./0633-sum-of-square-numbers.js)|Medium|
 637|[Average of Levels in Binary Tree](./0637-average-of-levels-in-binary-tree.js)|Easy|
 643|[Maximum Average Subarray I](./0643-maximum-average-subarray-i.js)|Easy|
 645|[Set Mismatch](./0645-set-mismatch.js)|Medium|

solutions/0633-sum-of-square-numbers.js

@@ -0,0 +1,22 @@
+/**
+ * 633. Sum of Square Numbers
+ * https://leetcode.com/problems/sum-of-square-numbers/
+ * Difficulty: Medium
+ *
+ * Given a non-negative integer c, decide whether there're two integers a and b such
+ * that a2 + b2 = c.
+ */
+
+/**
+ * @param {number} c
+ * @return {boolean}
+ */
+var judgeSquareSum = function(c) {
+  for (let left = 0, right = Math.floor(Math.sqrt(c)); left <= right;) {
+    const sum = left * left + right * right;
+    if (sum === c) return true;
+    if (sum < c) left++;
+    else right--;
+  }
+  return false;
+};