Sqrt(x) - https://leetcode.com/problems/sqrtx/description/

gistfile1.txt

class Solution {
    public int mySqrt(int x) {
      if (x == 1 || x == 0) {
        return x;
      }
        
      long low = 1;
      long high = x;
      
      // Need to use binary search to fix y such that y*y = x
      while (low < high && (high - low > 1)) {
        long mid = (long) ((high + low)/2);
        //System.out.println ("Mid is " + mid);
        if (mid == x/mid) {
          return (int) mid;
        } else if (mid > x/mid) {
          high = mid;
          //System.out.println ("High is " + high);
        } else {
          low = mid;
          //System.out.println ("Low is " + low);
        }
      }
      
      return (int) low;
    }
}