title: Minimum Steps Minimize N Per Given Condition
signature: func minimumStepsMinimizeNPerGivenCondition(n int) int {
test_code: package main
  
  import (
      "fmt"
      "reflect"
      "math"
      "sort"
  )
  
  // SOLUTION CODE
  // ===================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE
  // ===================================
  func validateSolution(actual int, expected int) bool {
      return reflect.DeepEqual(actual,expected)
  }
  
  func driver(n int, expected int) string {
      if validateSolution(PLACEHOLDER_FN_NAME(n),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver(59, 9)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver(7, 3)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver(90, 13)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver(78, 11)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver(49, 6)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver(15, 6)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver(45, 13)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver(56, 6)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver(7, 3)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver(70, 12)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
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 ];
  }