1 Binary Search - Leetcode 69 Sqrt(x) - Java

Problem: Given a non-negative integer x, return the square root of x rounded down to the nearest integer. The returned integer should be non-negative as well. You must not use any built-in exponent function or operator.

#Java #javaprogramming #leetcode #leetcodechallenge #fang #algorithm #datastructures #datastructuresandalgorithms #binarysearch