title: Square Root Of An Integer 1
signature: function squareRootOfAnInteger1(x: number): number {
test_code: 
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function convertToString(value: any): string{
      return JSON.stringify(value, function (key, val) {
          if (val instanceof Set) {
              return Array.from(val);
          } return val;});
  }
  
  function validateSolution(actual: number, expected: number): boolean {
      return convertToString(actual) === convertToString(expected);
  }
  
  function driver(x: number, expected:number): string {
      try{
          if (validateSolution(PLACEHOLDER_FN_NAME(x),expected)){
              return "PASSED";
          }
          return "FAILED";
      } catch (error) {
        return error.name;
      }
      
  }
      
  function main(){
    let result = '';
    result = driver(40, 6);
    console.log(`TEST-0...${result}`);
  
    result = driver(10, 3);
    console.log(`TEST-1...${result}`);
  
    result = driver(46, 6);
    console.log(`TEST-2...${result}`);
  
    result = driver(54, 7);
    console.log(`TEST-3...${result}`);
  
    result = driver(1, 1);
    console.log(`TEST-4...${result}`);
  
    result = driver(67, 8);
    console.log(`TEST-5...${result}`);
  
    result = driver(64, 8);
    console.log(`TEST-6...${result}`);
  
    result = driver(10, 3);
    console.log(`TEST-7...${result}`);
  
    result = driver(75, 8);
    console.log(`TEST-8...${result}`);
  
    result = driver(11, 3);
    console.log(`TEST-9...${result}`);
  
  };
  
  main();
source_py: def square_root_of_an_integer_1(x):
      if ((x == 0) or (x == 1)):
          return x
      start = 1
      end = x
      while (start <= end):
          mid = ((start + end) // 2)
          if ((mid * mid) == x):
              return mid
          if ((mid * mid) < x):
              start = (mid + 1)
              ans = mid
          else:
              end = (mid - 1)
      return ans
source_cpp: int square_root_of_an_integer_1(int x) {
    if ( x == 0 || x == 1 ) return x;
    int start = 1, end = x, ans;
    while ( start <= end ) {
      int mid = ( start + end ) / 2;
      if ( mid * mid == x ) return mid;
      if ( mid * mid < x ) {
        start = mid + 1;
        ans = mid;
      }
      else end = mid - 1;
    }
    return ans;
  }