<p>Given a non-negative integer <code>c</code>, decide whether there&#39;re two integers <code>a</code> and <code>b</code> such that <code>a<sup>2</sup> + b<sup>2</sup> = c</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> c = 5
<strong>Output:</strong> true
<strong>Explanation:</strong> 1 * 1 + 2 * 2 = 5
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> c = 3
<strong>Output:</strong> false
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>0 &lt;= c &lt;= 2<sup>31</sup> - 1</code></li>
</ul>

class Solution:
    def judgeSquareSum(self, c: int) -> bool:
        if (int(c**0.5))==float((c**0.5)):
            return True

        candidates = [i**2 for i in range(0,(int(c**0.5))+1)]

        i = 0
        j = len(candidates)-1
        
        while i<j:
            if 2*candidates[i] == c or 2*candidates[j]==c:
                return True
            if candidates[i]+candidates[j] == c:
                return True
            elif candidates[i]+candidates[j] < c:
                i+=1
            else:
                j-=1
        # for x in candidates:
        #     if 2*x == c:
        #         return True
        return False
18200