title: Maximum Subsequence Sum Such That No Three Are Consecutive
signature: def maximumSubsequenceSumSuchThatNoThreeAreConsecutive(arr: List[Int], n: 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(arr: List[Int], n: Int, expected: Int): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(arr, n),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        List(5, 6, 8, 9, 10, 10, 16, 17, 17, 20, 21, 22, 23, 28, 29, 32, 36, 37, 40, 41, 42, 43, 47, 47, 48, 48, 49, 49, 52, 52, 53, 59, 61, 64, 65, 79, 79, 81, 87, 91, 92, 98), 35, 
        832    
      )}")   
  
  
      println(s"TEST-1...${driver(
        List(98, 76, -80, -30, 82, 52, -14, 28, 98, 18, 82, 52, 26, -62, -8), 7, 
        308    
      )}")   
  
  
      println(s"TEST-2...${driver(
        List(0, 0, 0, 0, 0, 1, 1, 1, 1), 7, 
        2    
      )}")   
  
  
      println(s"TEST-3...${driver(
        List(21, 26, 85, 73, 47, 10, 54, 9, 11, 70, 42, 95, 44, 91), 12, 
        419    
      )}")   
  
  
      println(s"TEST-4...${driver(
        List(-94, -92, -90, -84, -76, -68, -60, -50, -34, -34, -20, -16, -6, 18, 50, 54, 66, 70, 96), 9, 
        -182    
      )}")   
  
  
      println(s"TEST-5...${driver(
        List(1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1), 16, 
        7    
      )}")   
  
  
      println(s"TEST-6...${driver(
        List(2, 3, 4, 4, 14, 14, 18, 21, 24, 26, 29, 31, 32, 34, 36, 37, 38, 40, 42, 44, 44, 54, 63, 69, 77, 77, 82, 82, 86, 87, 90, 93, 95), 31, 
        895    
      )}")   
  
  
      println(s"TEST-7...${driver(
        List(-46, 64, -44, 88, -74, 54, 40, -2, -24, 94, 40, -44, 56, -54, -60, -86, -58, 48, -90, 12, -76, -30, 94, -34, 14, 12, 80, -40, 60), 22, 
        450    
      )}")   
  
  
      println(s"TEST-8...${driver(
        List(0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1), 7, 
        0    
      )}")   
  
  
      println(s"TEST-9...${driver(
        List(4, 32, 63, 23, 44, 57, 59, 69, 88, 61, 66, 61, 65, 33, 79, 58, 71, 2, 80, 41, 83, 12, 20, 9, 7, 40, 36, 97, 10, 98, 66, 78, 71, 37, 53), 26, 
        895    
      )}")   
  
  }
  
source_py: def maximum_subsequence_sum_such_that_no_three_are_consecutive(arr, n):
      sum = [0 for k in range(n)]
      if (n >= 1):
          sum[0] = arr[0]
      if (n >= 2):
          sum[1] = (arr[0] + arr[1])
      if (n > 2):
          sum[2] = max(sum[1], max((arr[1] + arr[2]), (arr[0] + arr[2])))
      for i in range(3, n):
          sum[i] = max(max(sum[(i - 1)], (sum[(i - 2)] + arr[i])), ((arr[i] + arr[(i - 1)]) + sum[(i - 3)]))
      return sum[(n - 1)]
source_cpp: int maximum_subsequence_sum_such_that_no_three_are_consecutive(vector<int> arr, int n) {
    int sum [ n ];
    if ( n >= 1 ) sum [ 0 ] = arr [ 0 ];
    if ( n >= 2 ) sum [ 1 ] = arr [ 0 ] + arr [ 1 ];
    if ( n > 2 ) sum [ 2 ] = max ( sum [ 1 ], max ( arr [ 1 ] + arr [ 2 ], arr [ 0 ] + arr [ 2 ] ) );
    for ( int i = 3;
    i < n;
    i ++ ) sum [ i ] = max ( max ( sum [ i - 1 ], sum [ i - 2 ] + arr [ i ] ), arr [ i ] + arr [ i - 1 ] + sum [ i - 3 ] );
    return sum [ n - 1 ];
  }