title: Number Of Triangles In A Plane If No More Than Two Points Are Collinear
signature: class Solution {
  
      public Integer numberOfTrianglesInAPlaneIfNoMoreThanTwoPointsAreCollinear(Integer n) {
test_code: import static java.util.Map.entry;  
  import java.util.*;
  import java.lang.*;
  // TESTING CODE 
  // ============================================
  class QuestionEvaluator {
      public static String validateSolution(Integer n, Integer expected){
          try{
              Driver driver = new Driver();
              if (driver.run(n,expected)){
                  return "PASSED";
              }
              return "FAILED";
              
          } catch (Exception exception_obj){
              return exception_obj.getClass().getSimpleName();
          }
  
      }
      public static void main(String[] args) {
          String result;
          result = validateSolution(67, 47905);
          System.out.println(String.format("%s%s","TEST-0...",result));    
      
          result = validateSolution(58, 30856);
          System.out.println(String.format("%s%s","TEST-1...",result));    
      
          result = validateSolution(67, 47905);
          System.out.println(String.format("%s%s","TEST-2...",result));    
      
          result = validateSolution(60, 34220);
          System.out.println(String.format("%s%s","TEST-3...",result));    
      
          result = validateSolution(4, 4);
          System.out.println(String.format("%s%s","TEST-4...",result));    
      
          result = validateSolution(97, 147440);
          System.out.println(String.format("%s%s","TEST-5...",result));    
      
          result = validateSolution(9, 84);
          System.out.println(String.format("%s%s","TEST-6...",result));    
      
          result = validateSolution(16, 560);
          System.out.println(String.format("%s%s","TEST-7...",result));    
      
          result = validateSolution(83, 91881);
          System.out.println(String.format("%s%s","TEST-8...",result));    
      
          result = validateSolution(87, 105995);
          System.out.println(String.format("%s%s","TEST-9...",result));    
      
      }
  }
  
  class Driver{
      public boolean run(Integer n, Integer expected){
  
          PLACEHOLDER_CLS_NAME sol = new PLACEHOLDER_CLS_NAME();
          return validateSolution(sol.PLACEHOLDER_FN_NAME(n),expected);
      }
      
      public boolean validateSolution(Integer actual, Integer expected){
          return actual.equals(expected);
      }
  }
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
source_py: def number_of_triangles_in_a_plane_if_no_more_than_two_points_are_collinear(n):
      return (((n * (n - 1)) * (n - 2)) // 6)
source_cpp: int number_of_triangles_in_a_plane_if_no_more_than_two_points_are_collinear(int n) {
    return n * ( n - 1 ) * ( n - 2 ) / 6;
  }