title: Maximum Sum Iarri Among Rotations Given Array 1
signature: function maximum_sum_iarri_among_rotations_given_array_1(arr, n)
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(arr, n, expected)
      local exec_result;
      local status, error_msg = pcall(function () 
          exec_result=PLACEHOLDER_FN_NAME(arr, n) 
      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({6, 6, 13, 14, 16, 20, 24, 24, 24, 27, 28, 36, 49, 51, 55, 56, 62, 69, 74, 74, 76, 85, 86, 90, 92, 98}, 13, 2249)
      print(string.format("TEST-0...%s",result))
  
      result = driver({-42, 96, 68, 64, 14, -74, 76, 42, 34, -92, -20, 28, -80, -34, -22, 96, -46, 96, 10, -82, 82, 50, -24, 48, 56, 72, -40, -86, 84, 66, -62, 50, -76, 34}, 27, 9152)
      print(string.format("TEST-1...%s",result))
  
      result = driver({0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1}, 10, 35)
      print(string.format("TEST-2...%s",result))
  
      result = driver({37, 88, 70, 86, 24, 62, 34, 44, 37, 42, 46, 34, 23, 32, 55, 2, 5, 70, 30, 46, 40, 65, 91, 4, 7, 74, 46, 12, 30, 22, 1, 91, 89, 88, 97, 6, 6, 11, 33, 14, 68, 24}, 39, 34887)
      print(string.format("TEST-3...%s",result))
  
      result = driver({-92, -90, -70, -70, -10, 2, 10, 12, 14, 40, 44, 46, 64, 68, 68, 96}, 11, 586)
      print(string.format("TEST-4...%s",result))
  
      result = driver({1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1}, 15, 58)
      print(string.format("TEST-5...%s",result))
  
      result = driver({9, 15, 15, 17, 19, 20, 21, 23, 25, 25, 25, 32, 32, 33, 45, 51, 54, 59, 68, 71, 71, 71, 72, 75, 78, 80, 82, 82, 88, 89, 92, 93, 94, 97}, 22, 11145)
      print(string.format("TEST-6...%s",result))
  
      result = driver({52, -78, -80, 32, -56, -98, -36, 86, 34, -36, 42, 46, 50, 0, 34, -46, -2, -18, -96, 12, -42, 62, 32, 78, 66, -8, 50, 60, 10, -18, 66, 80, -24, -98, 8, 48, 34, 44, -80, -34, 72, 0, -60, 52, 40, 20}, 45, 14776)
      print(string.format("TEST-7...%s",result))
  
      result = driver({0, 0, 0, 0, 0, 0, 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}, 33, 297)
      print(string.format("TEST-8...%s",result))
  
      result = driver({45, 35, 25, 7, 24, 73, 25, 86, 48, 70, 47, 91, 96, 15, 39, 9}, 8, 1359)
      print(string.format("TEST-9...%s",result))
  
  end
  
  main()
source_py: def maximum_sum_iarri_among_rotations_given_array_1(arr, n):
      cum_sum = 0
      for i in range(0, n):
          cum_sum += arr[i]
      curr_val = 0
      for i in range(0, n):
          curr_val += (i * arr[i])
      res = curr_val
      for i in range(1, n):
          next_val = ((curr_val - (cum_sum - arr[(i - 1)])) + (arr[(i - 1)] * (n - 1)))
          curr_val = next_val
          res = max(res, next_val)
      return res
source_cpp: int maximum_sum_iarri_among_rotations_given_array_1(vector<int> arr, int n) {
    int cum_sum = 0;
    for ( int i = 0;
    i < n;
    i ++ ) cum_sum += arr [ i ];
    int curr_val = 0;
    for ( int i = 0;
    i < n;
    i ++ ) curr_val += i * arr [ i ];
    int res = curr_val;
    for ( int i = 1;
    i < n;
    i ++ ) {
      int next_val = curr_val - ( cum_sum - arr [ i - 1 ] ) + arr [ i - 1 ] * ( n - 1 );
      curr_val = next_val;
      res = max ( res, next_val );
    }
    return res;
  }