title: Minimum Steps Minimize N Per Given Condition
signature: pub fn minimum_steps_minimize_n_per_given_condition(n: i32) -> i32 {
test_code: use std::collections::HashMap;
  use std::collections::HashSet;
  use std::cmp::*;
  use std::collections::*;
  use std::fmt::*; 
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  pub fn validate_solution(actual: i32, expected: i32)->bool{
  return actual==expected
  }
  pub fn driver(n: i32, expected: i32)->String{
      if validate_solution(PLACEHOLDER_FN_NAME(n), expected) {
        return "PASSED".to_string();
      };
      return "FAILED".to_string();
  
  }
  
  fn main() {
      println!("TEST-0...{}", driver(
        59, 
        9
      ));
      
      println!("TEST-1...{}", driver(
        7, 
        3
      ));
      
      println!("TEST-2...{}", driver(
        90, 
        13
      ));
      
      println!("TEST-3...{}", driver(
        78, 
        11
      ));
      
      println!("TEST-4...{}", driver(
        49, 
        6
      ));
      
      println!("TEST-5...{}", driver(
        15, 
        6
      ));
      
      println!("TEST-6...{}", driver(
        45, 
        13
      ));
      
      println!("TEST-7...{}", driver(
        56, 
        6
      ));
      
      println!("TEST-8...{}", driver(
        7, 
        3
      ));
      
      println!("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 ];
  }