title: Minimum Time To Finish Tasks Without Skipping Two Consecutive
signature: function minimumTimeToFinishTasksWithoutSkippingTwoConsecutive(arr, n) {
test_code: 
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function convertToString(value) {
      return JSON.stringify(value, function (key, val) {
          if (val instanceof Set) {
              return Array.from(val);
          } return val;});
  }
  
  function validateSolution(actual, expected){
      return convertToString(actual)===convertToString(expected);
  }
  
  function driver(arr, n, expected){
      try{
          if (validateSolution(PLACEHOLDER_FN_NAME(arr, n),expected)){
              return "PASSED";
          }
          return "FAILED";
      } catch (error) {
        return error.name;
      }
      
  }
      
  function main(){
    let result = '';
    result = driver([5, 17, 25, 27, 29, 30, 34, 49, 72, 75, 90, 93, 93, 94], 8, 93);
    console.log(`TEST-0...${result}`);
  
    result = driver([-70, -32, 62, 0, -10, 92, -94, -86, 52, 6, -26, -92, -10, 70, -82, 28, 86, 58, 86, -58, 84, -80, -18, -92, -34, 6, 34, 36, 70, -50, -6, -54, 84, 22, 30, -96, -84, 72, 2, 26, -20, 4, 48, -98, 62, -28, -68], 36, -834);
    console.log(`TEST-1...${result}`);
  
    result = driver([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], 21, 5);
    console.log(`TEST-2...${result}`);
  
    result = driver([34, 40, 92, 35, 29, 26, 12, 66, 7, 28, 86, 4, 35, 79, 1, 48, 41, 47, 15, 75, 45, 6, 3, 94, 39, 50, 20, 8, 58, 51, 83, 44, 53, 76, 19, 84, 68, 54, 36, 53], 29, 359);
    console.log(`TEST-3...${result}`);
  
    result = driver([-98, -98, -92, -92, -88, -82, -74, -70, -68, -68, -64, -60, -52, -52, -42, -42, -38, -36, -36, -34, -26, -24, -22, -12, -2, -2, 4, 6, 44, 44, 48, 54, 62, 62, 64, 74, 78, 82, 86, 86, 90, 90, 94], 36, -1152);
    console.log(`TEST-4...${result}`);
  
    result = driver([1, 1, 0, 0, 1, 0, 0, 1, 1, 1], 5, 1);
    console.log(`TEST-5...${result}`);
  
    result = driver([9, 15, 19, 29, 30, 39, 40, 61], 4, 28);
    console.log(`TEST-6...${result}`);
  
    result = driver([92, 0, 46, 70, -60, -50, 58, -56, 8, -90, 84, 16, 40, -62, 50, 78, 26, -42, -40, 98, -52, 62, 16, -62, -76, -70, -60, 32, 4, -68, 52, -64, 70, 12, -10], 21, -314);
    console.log(`TEST-7...${result}`);
  
    result = driver([0, 0, 0, 1, 1, 1, 1], 5, 1);
    console.log(`TEST-8...${result}`);
  
    result = driver([32, 96, 63, 93, 53, 1, 22, 19, 50, 74, 6, 94, 81, 85, 4, 86, 88, 75, 94], 18, 397);
    console.log(`TEST-9...${result}`);
  
    process.exit(0);
  };
  
  if (require.main === module) {
    main();
  }
source_py: def minimum_time_to_finish_tasks_without_skipping_two_consecutive(arr, n):
      if (n <= 0):
          return 0
      incl = arr[0]
      excl = 0
      for i in range(1, n):
          incl_new = (arr[i] + min(excl, incl))
          excl_new = incl
          incl = incl_new
          excl = excl_new
      return min(incl, excl)
source_cpp: int minimum_time_to_finish_tasks_without_skipping_two_consecutive(vector<int> arr, int n) {
    if ( n <= 0 ) return 0;
    int incl = arr [ 0 ];
    int excl = 0;
    for ( int i = 1;
    i < n;
    i ++ ) {
      int incl_new = arr [ i ] + min ( excl, incl );
      int excl_new = incl;
      incl = incl_new;
      excl = excl_new;
    }
    return min ( incl, excl );
  }