title: Maximize Volume Cuboid Given Sum Sides
signature: def maximizeVolumeCuboidGivenSumSides(s: 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(s: Int, expected: Int): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(s),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        67, 
        11132    
      )}")   
  
  
      println(s"TEST-1...${driver(
        48, 
        4096    
      )}")   
  
  
      println(s"TEST-2...${driver(
        59, 
        7600    
      )}")   
  
  
      println(s"TEST-3...${driver(
        22, 
        392    
      )}")   
  
  
      println(s"TEST-4...${driver(
        14, 
        100    
      )}")   
  
  
      println(s"TEST-5...${driver(
        66, 
        10648    
      )}")   
  
  
      println(s"TEST-6...${driver(
        1, 
        0    
      )}")   
  
  
      println(s"TEST-7...${driver(
        75, 
        15625    
      )}")   
  
  
      println(s"TEST-8...${driver(
        58, 
        7220    
      )}")   
  
  
      println(s"TEST-9...${driver(
        78, 
        17576    
      )}")   
  
  }
  
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;
  }