title: Minimum Steps Minimize N Per Given Condition
signature: minimumStepsMinimizeNPerGivenCondition :: Integer -> Integer
  minimumStepsMinimizeNPerGivenCondition n = 
test_code: import Text.Printf
  import Control.Exception (catch, SomeException)
  import Data.Typeable
  import qualified Data.List as List
  import qualified Data.Map as Map
  import qualified Data.Set as Set
  
  -- SOLUTION CODE
  -- ============================================
  
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  validateSolution :: Integer -> Integer -> Bool
  validateSolution actual expected = do
      actual == expected
  
  
  driver :: Integer -> Integer -> String
  driver n expected = do
      if (validateSolution (PLACEHOLDER_FN_NAME n) expected)
          then "PASSED"
      else "FAILED"
  
  main = do
      printf "TEST-0...%s\n" (driver (59) (9) )
  
      printf "TEST-1...%s\n" (driver (7) (3) )
  
      printf "TEST-2...%s\n" (driver (90) (13) )
  
      printf "TEST-3...%s\n" (driver (78) (11) )
  
      printf "TEST-4...%s\n" (driver (49) (6) )
  
      printf "TEST-5...%s\n" (driver (15) (6) )
  
      printf "TEST-6...%s\n" (driver (45) (13) )
  
      printf "TEST-7...%s\n" (driver (56) (6) )
  
      printf "TEST-8...%s\n" (driver (7) (3) )
  
      printf "TEST-9...%s\n" (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 ];
  }