title: Dynamic Programming High Effort Vs Low Effort Tasks Problem
signature: dynamicProgrammingHighEffortVsLowEffortTasksProblem(high, low, n) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(high, low, n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(high, low, n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          [1, 3, 9, 10, 13, 14, 15, 15, 17, 22, 23, 28, 30, 31, 37, 42, 45, 62, 62, 68, 68, 68, 78, 79, 82, 84, 87, 90, 99], [5, 10, 11, 14, 16, 22, 24, 30, 34, 35, 37, 37, 39, 41, 42, 42, 43, 55, 57, 63, 71, 76, 83, 83, 85, 90, 91, 97, 99], 18, 
          537)
      }");
  
      print("TEST-1...${driver(
          [-78, -12, 26, 80, 50, 4, -80, 86, 12, -2, 18, -50, -90, 56, -50, 88, -62, 96, -44, -82, 56], [-44, -14, 14, 0, 30, 78, 40, -12, -44, -16, 60, -12, -50, -66, 70, -98, -56, 48, -82, 94, 14], 16, 
          452)
      }");
  
      print("TEST-2...${driver(
          [1], [1], 0, 
          0)
      }");
  
      print("TEST-3...${driver(
          [21, 28, 13, 48, 26, 49, 16, 70, 81, 35, 74, 12, 97, 61, 10, 84, 94, 78, 40, 30, 30, 84, 41, 4, 95, 79, 38, 29, 9], [49, 88, 25, 93, 24, 56, 47, 44, 33, 27, 86, 57, 21, 25, 64, 44, 37, 99, 36, 54, 17, 29, 37, 17, 26, 43, 61, 27, 21], 25, 
          1261)
      }");
  
      print("TEST-4...${driver(
          [-80, -36, -32, -20, -14, -12, 10, 12, 72], [-76, -54, -50, -28, 0, 58, 70, 78, 90], 4, 
          -56)
      }");
  
      print("TEST-5...${driver(
          [1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1], [0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1], 24, 
          15)
      }");
  
      print("TEST-6...${driver(
          [1, 7, 9, 10, 13, 14, 15, 20, 23, 24, 24, 24, 26, 27, 29, 31, 32, 33, 34, 35, 46, 48, 49, 51, 51, 53, 53, 56, 56, 60, 62, 64, 64, 70, 73, 73, 73, 74, 77, 78, 79, 79, 79, 80, 86, 89, 89, 92, 98], [1, 3, 3, 4, 8, 8, 10, 10, 10, 12, 12, 15, 15, 22, 23, 28, 28, 30, 31, 33, 34, 35, 36, 36, 36, 42, 44, 44, 51, 54, 57, 58, 59, 59, 63, 65, 66, 68, 69, 71, 73, 76, 77, 78, 79, 79, 86, 87, 93], 31, 
          784)
      }");
  
      print("TEST-7...${driver(
          [56, 48, 40, -56, 44, -86, -28, -32, -34, 4, -94, -14, 28, -74], [82, -40, -16, -64, 12, -6, 60, 48, -58, -4, 42, -28, 24, -58], 8, 
          268)
      }");
  
      print("TEST-8...${driver(
          [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1], 16, 
          5)
      }");
  
      print("TEST-9...${driver(
          [85, 13, 35, 57, 8, 48, 65, 54, 88, 7, 66, 30, 47, 51], [1, 42, 42, 89, 3, 21, 49, 98, 4, 59, 26, 85, 53, 34], 8, 
          453)
      }");
  
      return 0;
  }
source_py: def dynamic_programming_high_effort_vs_low_effort_tasks_problem(high, low, n):
      if (n <= 0):
          return 0
      return max((high[(n - 1)] + dynamic_programming_high_effort_vs_low_effort_tasks_problem(high, low, (n - 2))), (low[(n - 1)] + dynamic_programming_high_effort_vs_low_effort_tasks_problem(high, low, (n - 1))))
source_cpp: int dynamic_programming_high_effort_vs_low_effort_tasks_problem(vector<int> high, vector<int> low, int n) {
    if ( n <= 0 ) return 0;
    return max ( high [ n - 1 ] + dynamic_programming_high_effort_vs_low_effort_tasks_problem ( high, low, ( n - 2 ) ), low [ n - 1 ] + dynamic_programming_high_effort_vs_low_effort_tasks_problem ( high, low, ( n - 1 ) ) );
  }