title: Maximum Subarray Sum Array Created Repeated Concatenation
signature: function maximum_subarray_sum_array_created_repeated_concatenation(a, n, k)
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;
  }
question_info.test_code: 
  
  -- SOLUTION CODE
  -- ============================================
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  function isCorrect(actual, expected)
      if type(expected) ~= type(actual) then
          return false
      end
      
      if type(expected) == 'table' then
          for k,v_expected in pairs(expected) do
              
              if actual[k] == nil then
                  return false
              end
              local v_actual = actual[k]
              if not isCorrect(v_actual, v_expected) then
                  return false
              end
              actual[k]=nil
          end
      
          if next(actual) then 
              return false
          end
          return true
      else
          return actual == expected
      end
  end
  
  function validateSolution(actual, expected)
      return isCorrect(actual,expected)
  end
  
  function driver(a, n, k, expected)
      local exec_result;
      local status, error_msg = pcall(function () 
          exec_result=PLACEHOLDER_FN_NAME(a, n, k) 
      end)
      if status then
          if validateSolution(exec_result,expected) then
              return "PASSED"
          end
          return "FAILED"
      else
          return string.format("ERROR=%s",string.gsub(error_msg,".*:[%d]+: ",""))
      end
  end
      
  function main()
      result = driver({5, 6, 12, 20, 23, 28, 33, 37, 47, 51, 53, 56, 63, 65, 65, 68, 69, 76, 76, 78, 83}, 18, 20, 15540)
      print(string.format("TEST-0...%s",result))
  
      result = driver({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, 218)
      print(string.format("TEST-1...%s",result))
  
      result = driver({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, 522)
      print(string.format("TEST-2...%s",result))
  
      result = driver({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, 29070)
      print(string.format("TEST-3...%s",result))
  
      result = driver({-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, 18)
      print(string.format("TEST-4...%s",result))
  
      result = driver({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, 300)
      print(string.format("TEST-5...%s",result))
  
      result = driver({3, 7, 11, 11, 26, 60, 68, 71, 77, 91, 95}, 8, 10, 2570)
      print(string.format("TEST-6...%s",result))
  
      result = driver({28, 48, -86, -52, 6, 4, 30, 18, -32, 60, -2, 16, -88, -36}, 8, 11, 134)
      print(string.format("TEST-7...%s",result))
  
      result = driver({1}, 0, 0, -2147483648)
      print(string.format("TEST-8...%s",result))
  
      result = driver({76}, 0, 0, -2147483648)
      print(string.format("TEST-9...%s",result))
  
  end
  
  main()
question_info.entry_cls_name: Solution
question_info.test_list: [{"idx": 0, "outputs": 15540, "inputs": {"a": [5, 6, 12, 20, 23, 28, 33, 37, 47, 51, 53, 56, 63, 65, 65, 68, 69, 76, 76, 78, 83], "n": 18, "k": 20}}, {"idx": 1, "outputs": 218, "inputs": {"a": [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], "n": 22, "k": 22}}, {"idx": 2, "outputs": 522, "inputs": {"a": [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], "n": 34, "k": 29}}, {"idx": 3, "outputs": 29070, "inputs": {"a": [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], "n": 23, "k": 30}}, {"idx": 4, "outputs": 18, "inputs": {"a": [-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], "n": 17, "k": 23}}, {"idx": 5, "outputs": 300, "inputs": {"a": [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], "n": 16, "k": 25}}, {"idx": 6, "outputs": 2570, "inputs": {"a": [3, 7, 11, 11, 26, 60, 68, 71, 77, 91, 95], "n": 8, "k": 10}}, {"idx": 7, "outputs": 134, "inputs": {"a": [28, 48, -86, -52, 6, 4, 30, 18, -32, 60, -2, 16, -88, -36], "n": 8, "k": 11}}, {"idx": 8, "outputs": -2147483648, "inputs": {"a": [1], "n": 0, "k": 0}}, {"idx": 9, "outputs": -2147483648, "inputs": {"a": [76], "n": 0, "k": 0}}]
question_info.extension: lua
question_info.entry_fn_name: maximum_subarray_sum_array_created_repeated_concatenation
question_info.test_case_ids: 0 1 2 3 4 5 6 7 8 9
question_info.commands: lua __FILENAME__