title: Square Root Of An Integer 1
signature: fun squareRootOfAnInteger1(x: Int): Int {
test_code: package main
  
  import kotlin.text.*
  import kotlin.math.*
  
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  fun validateSolution(actual:Int, expected:Int):Boolean{
    return actual.equals(expected)
  }
  fun driver(x: Int, expected:Int):String {
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME(x), expected)) {
                return "PASSED"
        }
        return "FAILED"
      } catch (e: Exception){
        return e::class.simpleName as String
      }
  
  }
  
  fun main() {
      var result: String = ""
      result = driver(40, 6)
      println("TEST-0...${result}")
      
      result = driver(10, 3)
      println("TEST-1...${result}")
      
      result = driver(46, 6)
      println("TEST-2...${result}")
      
      result = driver(54, 7)
      println("TEST-3...${result}")
      
      result = driver(1, 1)
      println("TEST-4...${result}")
      
      result = driver(67, 8)
      println("TEST-5...${result}")
      
      result = driver(64, 8)
      println("TEST-6...${result}")
      
      result = driver(10, 3)
      println("TEST-7...${result}")
      
      result = driver(75, 8)
      println("TEST-8...${result}")
      
      result = driver(11, 3)
      println("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;
  }