title: Minimum Time Write Characters Using Insert Delete Copy Operation
signature: def minimumTimeWriteCharactersUsingInsertDeleteCopyOperation(n: Int, insrt: Int, remov: Int, cpy: Int) = {
test_code: import scala.collection.mutable.HashMap
  import scala.collection.immutable.HashSet
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  
  // TESTING CODE 
  // ============================================
  def validateSolution(actual: Int , expected: Int): Boolean = {
      actual.toString == expected.toString
  }
  
  def driver(n: Int, insrt: Int, remov: Int, cpy: Int, expected: Int): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(n, insrt, remov, cpy),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        59, 75, 12, 45, 
        351    
      )}")   
  
  
      println(s"TEST-1...${driver(
        66, 68, 32, 41, 
        382    
      )}")   
  
  
      println(s"TEST-2...${driver(
        98, 55, 69, 5, 
        195    
      )}")   
  
  
      println(s"TEST-3...${driver(
        63, 4, 41, 12, 
        76    
      )}")   
  
  
      println(s"TEST-4...${driver(
        99, 37, 98, 55, 
        460    
      )}")   
  
  
      println(s"TEST-5...${driver(
        45, 28, 59, 7, 
        147    
      )}")   
  
  
      println(s"TEST-6...${driver(
        60, 53, 40, 52, 
        405    
      )}")   
  
  
      println(s"TEST-7...${driver(
        11, 96, 50, 50, 
        392    
      )}")   
  
  
      println(s"TEST-8...${driver(
        96, 95, 48, 84, 
        694    
      )}")   
  
  
      println(s"TEST-9...${driver(
        54, 6, 50, 82, 
        244    
      )}")   
  
  }
  
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 ];
  }