title: Minimum Steps Minimize N Per Given Condition
signature: minimum_steps_minimize_n_per_given_condition <- function(n) {
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 ];
  }