title: Square Root Of An Integer 1
signature: def squareRootOfAnInteger1(x: Int) = {
test_code: import scala.collection.mutable.HashMap
  import scala.collection.immutable.HashSet
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  
  // TESTING CODE 
  // ============================================
  def validateSolution(actual: Int , expected: Int): Boolean = {
      actual.toString == expected.toString
  }
  
  def driver(x: Int, expected: Int): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(x),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        40, 
        6    
      )}")   
  
  
      println(s"TEST-1...${driver(
        10, 
        3    
      )}")   
  
  
      println(s"TEST-2...${driver(
        46, 
        6    
      )}")   
  
  
      println(s"TEST-3...${driver(
        54, 
        7    
      )}")   
  
  
      println(s"TEST-4...${driver(
        1, 
        1    
      )}")   
  
  
      println(s"TEST-5...${driver(
        67, 
        8    
      )}")   
  
  
      println(s"TEST-6...${driver(
        64, 
        8    
      )}")   
  
  
      println(s"TEST-7...${driver(
        10, 
        3    
      )}")   
  
  
      println(s"TEST-8...${driver(
        75, 
        8    
      )}")   
  
  
      println(s"TEST-9...${driver(
        11, 
        3    
      )}")   
  
  }
  
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;
  }