title: Minimum Steps Minimize N Per Given Condition
signature: minimumStepsMinimizeNPerGivenCondition(n) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          59, 
          9)
      }");
  
      print("TEST-1...${driver(
          7, 
          3)
      }");
  
      print("TEST-2...${driver(
          90, 
          13)
      }");
  
      print("TEST-3...${driver(
          78, 
          11)
      }");
  
      print("TEST-4...${driver(
          49, 
          6)
      }");
  
      print("TEST-5...${driver(
          15, 
          6)
      }");
  
      print("TEST-6...${driver(
          45, 
          13)
      }");
  
      print("TEST-7...${driver(
          56, 
          6)
      }");
  
      print("TEST-8...${driver(
          7, 
          3)
      }");
  
      print("TEST-9...${driver(
          70, 
          12)
      }");
  
      return 0;
  }
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 ];
  }