title: Check Two Given Circles Touch Intersect
signature: def checkTwoGivenCirclesTouchIntersect(x1: Int, y1: Int, x2: Int, y2: Int, r1: Int, r2: 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(x1: Int, y1: Int, x2: Int, y2: Int, r1: Int, r2: Int, expected: Int): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(x1, y1, x2, y2, r1, r2),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        11, 36, 62, 64, 50, 4, 
        -1    
      )}")   
  
  
      println(s"TEST-1...${driver(
        87, 1, 62, 64, 54, 41, 
        0    
      )}")   
  
  
      println(s"TEST-2...${driver(
        51, 1, 47, 90, 14, 71, 
        -1    
      )}")   
  
  
      println(s"TEST-3...${driver(
        89, 67, 9, 52, 94, 21, 
        0    
      )}")   
  
  
      println(s"TEST-4...${driver(
        64, 10, 79, 45, 67, 78, 
        0    
      )}")   
  
  
      println(s"TEST-5...${driver(
        57, 86, 99, 43, 83, 63, 
        0    
      )}")   
  
  
      println(s"TEST-6...${driver(
        65, 90, 42, 82, 77, 32, 
        0    
      )}")   
  
  
      println(s"TEST-7...${driver(
        32, 23, 28, 26, 60, 45, 
        0    
      )}")   
  
  
      println(s"TEST-8...${driver(
        73, 61, 63, 77, 92, 76, 
        0    
      )}")   
  
  
      println(s"TEST-9...${driver(
        3, 99, 6, 19, 21, 28, 
        -1    
      )}")   
  
  }
  
source_py: def check_two_given_circles_touch_intersect(x1, y1, x2, y2, r1, r2):
      distSq = (((x1 - x2) * (x1 - x2)) + ((y1 - y2) * (y1 - y2)))
      radSumSq = ((r1 + r2) * (r1 + r2))
      if (distSq == radSumSq):
          return 1
      elif (distSq > radSumSq):
          return (- 1)
      else:
          return 0
source_cpp: int check_two_given_circles_touch_intersect(int x1, int y1, int x2, int y2, int r1, int r2) {
    int distSq = ( x1 - x2 ) * ( x1 - x2 ) + ( y1 - y2 ) * ( y1 - y2 );
    int radSumSq = ( r1 + r2 ) * ( r1 + r2 );
    if ( distSq == radSumSq ) return 1;
    else if ( distSq > radSumSq ) return - 1;
    else return 0;
  }