title: Maximum Subarray Sum Array Created Repeated Concatenation
signature: def maximumSubarraySumArrayCreatedRepeatedConcatenation(a: List[Int], n: Int, k: Int) = {
test_code: import scala.collection.mutable.HashMap
  import scala.collection.immutable.HashSet
  
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  
  // TESTING CODE 
  // ============================================
  def validateSolution(actual: Long , expected: Long): Boolean = {
      actual.toString == expected.toString
  }
  
  def driver(a: List[Int], n: Int, k: Int, expected: Long): String = {
      try {
          if (validateSolution(PLACEHOLDER_FN_NAME(a, n, k),expected)) {
              "PASSED"
          } else{
              "FAILED"
          }
      }catch{
          case e: Exception => {e.getClass.getName}
      }
  
  }
  object QuestionEvaluator extends App {
  
      println(s"TEST-0...${driver(
        List(5, 6, 12, 20, 23, 28, 33, 37, 47, 51, 53, 56, 63, 65, 65, 68, 69, 76, 76, 78, 83), 18, 20, 
        15540L    
      )}")   
  
  
      println(s"TEST-1...${driver(
        List(68, 10, 52, -44, 34, -4, -34, 2, 50, -60, 50, 94, -98, -98, -44, -36, -4, -62, -2, -92, -70, -48, -78, -10, 94), 22, 22, 
        218L    
      )}")   
  
  
      println(s"TEST-2...${driver(
        List(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1), 34, 29, 
        522L    
      )}")   
  
  
      println(s"TEST-3...${driver(
        List(71, 59, 21, 82, 73, 29, 30, 25, 21, 10, 85, 22, 60, 43, 49, 20, 34, 39, 69, 6, 44, 27, 50, 33, 57, 29, 65, 18, 68, 56, 50, 28), 23, 30, 
        29070L    
      )}")   
  
  
      println(s"TEST-4...${driver(
        List(-84, -74, -74, -56, -54, -48, -48, -46, -42, -34, -32, -30, -18, -16, -16, 6, 12, 20, 24, 26, 30, 32, 34, 42, 42, 42, 44, 46, 46, 50, 50, 62, 72, 78, 90), 17, 23, 
        18L    
      )}")   
  
  
      println(s"TEST-5...${driver(
        List(0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0), 16, 25, 
        300L    
      )}")   
  
  
      println(s"TEST-6...${driver(
        List(3, 7, 11, 11, 26, 60, 68, 71, 77, 91, 95), 8, 10, 
        2570L    
      )}")   
  
  
      println(s"TEST-7...${driver(
        List(28, 48, -86, -52, 6, 4, 30, 18, -32, 60, -2, 16, -88, -36), 8, 11, 
        134L    
      )}")   
  
  
      println(s"TEST-8...${driver(
        List(1), 0, 0, 
        -2147483648L    
      )}")   
  
  
      println(s"TEST-9...${driver(
        List(76), 0, 0, 
        -2147483648L    
      )}")   
  
  }
  
source_py: def maximum_subarray_sum_array_created_repeated_concatenation(a, n, k):
      max_so_far = (- 2147483648)
      max_ending_here = 0
      for i in range((n * k)):
          max_ending_here = (max_ending_here + a[(i % n)])
          if (max_so_far < max_ending_here):
              max_so_far = max_ending_here
          if (max_ending_here < 0):
              max_ending_here = 0
      return max_so_far
source_cpp: int maximum_subarray_sum_array_created_repeated_concatenation(vector<int> a, int n, int k) {
    int max_so_far = INT_MIN, max_ending_here = 0;
    for ( int i = 0;
    i < n * k;
    i ++ ) {
      max_ending_here = max_ending_here + a [ i % n ];
      if ( max_so_far < max_ending_here ) max_so_far = max_ending_here;
      if ( max_ending_here < 0 ) max_ending_here = 0;
    }
    return max_so_far;
  }