title: Minimum Steps Minimize N Per Given Condition
signature: def minimumStepsMinimizeNPerGivenCondition(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(
        59, 
        9    
      )}")   
  
  
      println(s"TEST-1...${driver(
        7, 
        3    
      )}")   
  
  
      println(s"TEST-2...${driver(
        90, 
        13    
      )}")   
  
  
      println(s"TEST-3...${driver(
        78, 
        11    
      )}")   
  
  
      println(s"TEST-4...${driver(
        49, 
        6    
      )}")   
  
  
      println(s"TEST-5...${driver(
        15, 
        6    
      )}")   
  
  
      println(s"TEST-6...${driver(
        45, 
        13    
      )}")   
  
  
      println(s"TEST-7...${driver(
        56, 
        6    
      )}")   
  
  
      println(s"TEST-8...${driver(
        7, 
        3    
      )}")   
  
  
      println(s"TEST-9...${driver(
        70, 
        12    
      )}")   
  
  }
  
source_py: def minimum_steps_minimize_n_per_given_condition(n):
      table = ([0] * (n + 1))
      for i in range((n + 1)):
          table[i] = (n - i)
      for i in range(n, 0, (- 1)):
          if (not (i % 2)):
              table[(i // 2)] = min((table[i] + 1), table[(i // 2)])
          if (not (i % 3)):
              table[(i // 3)] = min((table[i] + 1), table[(i // 3)])
      return table[1]
source_cpp: int minimum_steps_minimize_n_per_given_condition(int n) {
    int table [ n + 1 ];
    for ( int i = 0;
    i <= n;
    i ++ ) table [ i ] = n - i;
    for ( int i = n;
    i >= 1;
    i -- ) {
      if ( ! ( i % 2 ) ) table [ i / 2 ] = min ( table [ i ] + 1, table [ i / 2 ] );
      if ( ! ( i % 3 ) ) table [ i / 3 ] = min ( table [ i ] + 1, table [ i / 3 ] );
    }
    return table [ 1 ];
  }