title: Maximum Points Intersection N Circles
signature: def maximumPointsIntersectionNCircles(n: 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(n: Int, expected: Int): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(n),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        30, 
        870    
      )}")   
  
  
      println(s"TEST-1...${driver(
        25, 
        600    
      )}")   
  
  
      println(s"TEST-2...${driver(
        69, 
        4692    
      )}")   
  
  
      println(s"TEST-3...${driver(
        39, 
        1482    
      )}")   
  
  
      println(s"TEST-4...${driver(
        14, 
        182    
      )}")   
  
  
      println(s"TEST-5...${driver(
        60, 
        3540    
      )}")   
  
  
      println(s"TEST-6...${driver(
        89, 
        7832    
      )}")   
  
  
      println(s"TEST-7...${driver(
        27, 
        702    
      )}")   
  
  
      println(s"TEST-8...${driver(
        29, 
        812    
      )}")   
  
  
      println(s"TEST-9...${driver(
        29, 
        812    
      )}")   
  
  }
  
source_py: def maximum_points_intersection_n_circles(n):
      return (n * (n - 1))
source_cpp: int maximum_points_intersection_n_circles(int n) {
    return n * ( n - 1 );
  }