title: Maximize Volume Cuboid Given Sum Sides
signature: function maximizeVolumeCuboidGivenSumSides(s) {
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(s, expected){
      try{
          if (validateSolution(PLACEHOLDER_FN_NAME(s),expected)){
              return "PASSED";
          }
          return "FAILED";
      } catch (error) {
        return error.name;
      }
      
  }
      
  function main(){
    let result = '';
    result = driver(67, 11132);
    console.log(`TEST-0...${result}`);
  
    result = driver(48, 4096);
    console.log(`TEST-1...${result}`);
  
    result = driver(59, 7600);
    console.log(`TEST-2...${result}`);
  
    result = driver(22, 392);
    console.log(`TEST-3...${result}`);
  
    result = driver(14, 100);
    console.log(`TEST-4...${result}`);
  
    result = driver(66, 10648);
    console.log(`TEST-5...${result}`);
  
    result = driver(1, 0);
    console.log(`TEST-6...${result}`);
  
    result = driver(75, 15625);
    console.log(`TEST-7...${result}`);
  
    result = driver(58, 7220);
    console.log(`TEST-8...${result}`);
  
    result = driver(78, 17576);
    console.log(`TEST-9...${result}`);
  
    process.exit(0);
  };
  
  if (require.main === module) {
    main();
  }
source_py: def maximize_volume_cuboid_given_sum_sides(s):
      maxvalue = 0
      i = 1
      for i in range((s - 1)):
          j = 1
          for j in range(s):
              k = ((s - i) - j)
              maxvalue = max(maxvalue, ((i * j) * k))
      return maxvalue
source_cpp: int maximize_volume_cuboid_given_sum_sides(int s) {
    int maxvalue = 0;
    for ( int i = 1;
    i <= s - 2;
    i ++ ) {
      for ( int j = 1;
      j <= s - 1;
      j ++ ) {
        int k = s - i - j;
        maxvalue = max ( maxvalue, i * j * k );
      }
    }
    return maxvalue;
  }