Implement int sqrt(int x).
Compute and return the square root of x.
- Wrap a set of
n^2values into an iterator, and use binary search from standard library to find a solution ofn^2 == xinO(1)memory andO(log n)time. - Save
O(sqrt n)possible solutions into a container, and use a custom comparator. Assume that value we seek is only used as a first argument in comparison.