title: Maximize Volume Cuboid Given Sum Sides
signature: func maximizeVolumeCuboidGivenSumSides(s int) int {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual int, expected int) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(s int, expected int) string {
      if validateSolution(PLACEHOLDER_FN_NAME(s),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver(67, 11132)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver(48, 4096)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver(59, 7600)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver(22, 392)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver(14, 100)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver(66, 10648)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver(1, 0)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver(75, 15625)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver(58, 7220)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver(78, 17576)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
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;
  }