<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:
        r_n = 0
        while r_n * r_n <= c:
            r_n += 1
        r_n -= 1 

        l_n = 0

        while l_n <= r_n:
            current_sum = l_n**2 + r_n**2
            if current_sum == c:
                return True
            elif current_sum < c:
                l_n += 1
            else:
                r_n -= 1

        return False

16400