title: Minimum Steps Minimize N Per Given Condition
signature: function minimumStepsMinimizeNPerGivenCondition(n) {
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(n, expected){
      try{
          if (validateSolution(PLACEHOLDER_FN_NAME(n),expected)){
              return "PASSED";
          }
          return "FAILED";
      } catch (error) {
        return error.name;
      }
      
  }
      
  function main(){
    let result = '';
    result = driver(59, 9);
    console.log(`TEST-0...${result}`);
  
    result = driver(7, 3);
    console.log(`TEST-1...${result}`);
  
    result = driver(90, 13);
    console.log(`TEST-2...${result}`);
  
    result = driver(78, 11);
    console.log(`TEST-3...${result}`);
  
    result = driver(49, 6);
    console.log(`TEST-4...${result}`);
  
    result = driver(15, 6);
    console.log(`TEST-5...${result}`);
  
    result = driver(45, 13);
    console.log(`TEST-6...${result}`);
  
    result = driver(56, 6);
    console.log(`TEST-7...${result}`);
  
    result = driver(7, 3);
    console.log(`TEST-8...${result}`);
  
    result = driver(70, 12);
    console.log(`TEST-9...${result}`);
  
    process.exit(0);
  };
  
  if (require.main === module) {
    main();
  }
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 ];
  }