title: Square Root Of An Integer 1
signature: squareRootOfAnInteger1(x) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(x, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(x), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          40, 
          6)
      }");
  
      print("TEST-1...${driver(
          10, 
          3)
      }");
  
      print("TEST-2...${driver(
          46, 
          6)
      }");
  
      print("TEST-3...${driver(
          54, 
          7)
      }");
  
      print("TEST-4...${driver(
          1, 
          1)
      }");
  
      print("TEST-5...${driver(
          67, 
          8)
      }");
  
      print("TEST-6...${driver(
          64, 
          8)
      }");
  
      print("TEST-7...${driver(
          10, 
          3)
      }");
  
      print("TEST-8...${driver(
          75, 
          8)
      }");
  
      print("TEST-9...${driver(
          11, 
          3)
      }");
  
      return 0;
  }
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;
  }