Problem
The integer square root of n is the square root rounded down: the largest integer r with r × r ≤ n. Library square roots work on floating point numbers and can be off by one for large inputs, so compute it with integers only, for example with a binary search over possible answers.
Implement integer_square_root(n).
Input
n: A non-negative integer.
Output
Return the largest integer r such that r × r ≤ n.
Constraints
0 ≤ n ≤ 10^18
Examples
Input:
n = 50
Expected output:
expected = 7
Input:
long long n = 50;
Expected output:
long long expected = 7;
Input:
long n = 50;
Expected output:
long expected = 7;
Explanation
7 × 7 = 49 ≤ 50 but 8 × 8 = 64 > 50, so the answer is 7.
Input:
n = 144
Expected output:
expected = 12
Input:
long long n = 144;
Expected output:
long long expected = 12;
Input:
long n = 144;
Expected output:
long expected = 12;
Explanation
144 is exactly 12 × 12, so the answer is 12.
How to approach it
Try on your own first, then open one hint at a time.
Hint 1
The answer lies between 0 and n, and r × r grows as r grows, so you can halve the range each step.
Hint 2
For large n, r × r can overflow; compare r with n / r instead, or cap the upper bound.
Hint 3
Check small inputs like 0, 1 and 3 by hand.
Expected complexity
O(log n) time, O(1) extra space
References
This challenge is adapted for CodeUtility. Follow the statement and constraints above.