title: Minimum Time Write Characters Using Insert Delete Copy Operation
signature: func minimumTimeWriteCharactersUsingInsertDeleteCopyOperation(n int, insrt int, remov int, cpy 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, insrt int, remov int, cpy int, expected int) string {
      if validateSolution(PLACEHOLDER_FN_NAME(n, insrt, remov, cpy),expected) {
              return "PASSED"
      }
      return "FAILED"
  
  }
  
  func main() {
  
      // Use imports to avoid undefined errors
      var _ = reflect.DeepEqual
      _ = math.Abs
      _ = sort.Sort
      result := ""
      result = driver(59, 
  	75, 
  	12, 
  	45, 351)
      fmt.Printf("TEST-0...%s\n", result)
      
      result = driver(66, 
  	68, 
  	32, 
  	41, 382)
      fmt.Printf("TEST-1...%s\n", result)
      
      result = driver(98, 
  	55, 
  	69, 
  	5, 195)
      fmt.Printf("TEST-2...%s\n", result)
      
      result = driver(63, 
  	4, 
  	41, 
  	12, 76)
      fmt.Printf("TEST-3...%s\n", result)
      
      result = driver(99, 
  	37, 
  	98, 
  	55, 460)
      fmt.Printf("TEST-4...%s\n", result)
      
      result = driver(45, 
  	28, 
  	59, 
  	7, 147)
      fmt.Printf("TEST-5...%s\n", result)
      
      result = driver(60, 
  	53, 
  	40, 
  	52, 405)
      fmt.Printf("TEST-6...%s\n", result)
      
      result = driver(11, 
  	96, 
  	50, 
  	50, 392)
      fmt.Printf("TEST-7...%s\n", result)
      
      result = driver(96, 
  	95, 
  	48, 
  	84, 694)
      fmt.Printf("TEST-8...%s\n", result)
      
      result = driver(54, 
  	6, 
  	50, 
  	82, 244)
      fmt.Printf("TEST-9...%s\n", result)
      
          
  }
source_py: def minimum_time_write_characters_using_insert_delete_copy_operation(N, insrt, remov, cpy):
      if (N == 0):
          return 0
      if (N == 1):
          return insrt
      dp = ([0] * (N + 1))
      for i in range(1, (N + 1)):
          if ((i % 2) == 0):
              dp[i] = min((dp[(i - 1)] + insrt), (dp[(i // 2)] + cpy))
          else:
              dp[i] = min((dp[(i - 1)] + insrt), ((dp[((i + 1) // 2)] + cpy) + remov))
      return dp[N]
source_cpp: int minimum_time_write_characters_using_insert_delete_copy_operation(int N, int insert, int remove, int copy) {
    if ( N == 0 ) return 0;
    if ( N == 1 ) return insert;
    int dp [ N + 1 ];
    memset ( dp, 0, sizeof ( dp ) );
    for ( int i = 1;
    i <= N;
    i ++ ) {
      if ( i % 2 == 0 ) dp [ i ] = min ( dp [ i - 1 ] + insert, dp [ i / 2 ] + copy );
      else dp [ i ] = min ( dp [ i - 1 ] + insert, dp [ ( i + 1 ) / 2 ] + copy + remove );
    }
    return dp [ N ];
  }