title: Recursively Break Number 3 Parts Get Maximum Sum
signature: function recursivelyBreakNumber3PartsGetMaximumSum(n) {
test_code: 
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function convertToString(value) {
      return JSON.stringify(value, function (key, val) {
          if (val instanceof Set) {
              return Array.from(val);
          } return val;});
  }
  
  function validateSolution(actual, expected){
      return convertToString(actual)===convertToString(expected);
  }
  
  function driver(n, expected){
      try{
          if (validateSolution(PLACEHOLDER_FN_NAME(n),expected)){
              return "PASSED";
          }
          return "FAILED";
      } catch (error) {
        return error.name;
      }
      
  }
      
  function main(){
    let result = '';
    result = driver(39, 41);
    console.log(`TEST-0...${result}`);
  
    result = driver(79, 87);
    console.log(`TEST-1...${result}`);
  
    result = driver(7, 7);
    console.log(`TEST-2...${result}`);
  
    result = driver(76, 87);
    console.log(`TEST-3...${result}`);
  
    result = driver(48, 57);
    console.log(`TEST-4...${result}`);
  
    result = driver(18, 19);
    console.log(`TEST-5...${result}`);
  
    result = driver(58, 63);
    console.log(`TEST-6...${result}`);
  
    result = driver(17, 17);
    console.log(`TEST-7...${result}`);
  
    result = driver(36, 41);
    console.log(`TEST-8...${result}`);
  
    result = driver(5, 5);
    console.log(`TEST-9...${result}`);
  
    process.exit(0);
  };
  
  if (require.main === module) {
    main();
  }
source_py: def recursively_break_number_3_parts_get_maximum_sum(n):
      if ((n == 0) or (n == 1)):
          return n
      return max(((recursively_break_number_3_parts_get_maximum_sum((n // 2)) + recursively_break_number_3_parts_get_maximum_sum((n // 3))) + recursively_break_number_3_parts_get_maximum_sum((n // 4))), n)
source_cpp: int recursively_break_number_3_parts_get_maximum_sum(int n) {
    if ( n == 0 || n == 1 ) return n;
    return max ( ( recursively_break_number_3_parts_get_maximum_sum ( n / 2 ) + recursively_break_number_3_parts_get_maximum_sum ( n / 3 ) + recursively_break_number_3_parts_get_maximum_sum ( n / 4 ) ), n );
  }