<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:
        
        # iterate till sqrt of the number
        squared_list = []
        for i in range(int(math.sqrt(c))+1):
            squared_list.append(i*i)

        # print(squared_list)

        l, r = 0, len(squared_list)-1

        while l <= r:
            num_l, num_r = squared_list[l], squared_list[r]
            if num_l + num_r  == c:
                return True

            elif num_l + num_r < c:
                l += 1

            else:
                r -= 1

        return False

17900