title: Square Root Of An Integer 1
signature: pub fn square_root_of_an_integer_1(x: i32) -> i32 {
test_code: use std::collections::HashMap;
  use std::collections::HashSet;
  use std::cmp::*;
  use std::collections::*;
  use std::fmt::*; 
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  pub fn validate_solution(actual: i32, expected: i32)->bool{
  return actual==expected
  }
  pub fn driver(x: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(x), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        40, 
        6
      ));
      
      println!("TEST-1...{}", driver(
        10, 
        3
      ));
      
      println!("TEST-2...{}", driver(
        46, 
        6
      ));
      
      println!("TEST-3...{}", driver(
        54, 
        7
      ));
      
      println!("TEST-4...{}", driver(
        1, 
        1
      ));
      
      println!("TEST-5...{}", driver(
        67, 
        8
      ));
      
      println!("TEST-6...{}", driver(
        64, 
        8
      ));
      
      println!("TEST-7...{}", driver(
        10, 
        3
      ));
      
      println!("TEST-8...{}", driver(
        75, 
        8
      ));
      
      println!("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;
  }