title: Recursively Break Number 3 Parts Get Maximum Sum
signature: def recursivelyBreakNumber3PartsGetMaximumSum(n: 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(n: Int, expected: Int): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(n),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        39, 
        41    
      )}")   
  
  
      println(s"TEST-1...${driver(
        79, 
        87    
      )}")   
  
  
      println(s"TEST-2...${driver(
        7, 
        7    
      )}")   
  
  
      println(s"TEST-3...${driver(
        76, 
        87    
      )}")   
  
  
      println(s"TEST-4...${driver(
        48, 
        57    
      )}")   
  
  
      println(s"TEST-5...${driver(
        18, 
        19    
      )}")   
  
  
      println(s"TEST-6...${driver(
        58, 
        63    
      )}")   
  
  
      println(s"TEST-7...${driver(
        17, 
        17    
      )}")   
  
  
      println(s"TEST-8...${driver(
        36, 
        41    
      )}")   
  
  
      println(s"TEST-9...${driver(
        5, 
        5    
      )}")   
  
  }
  
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 );
  }