Integer square root Newton
Compute the integer square root of a non-negative integer x WITHOUT using any floating point (no math.sqrt, no **0.5): return the largest integer r such that r*r <= x. Use Newton's method (integer iteration). Constraints: 0 <= x <= 10^18. Example: isqrt(8) = 2, isqrt(16) = 4.
Implement
integer_sqrt(x: int) → intExamples
in
[8]out2What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 20 min
solution.py
InputExpectedGot
[8]2not run yetsample