# Maximum Array Rotation in Python

Published on 28 April 2022 (Updated: 02 February 2023) Welcome to the Maximum Array Rotation in Python page! Here, you’ll find the source code for this program as well as a description of how the program works.

## Current Solution

``````import sys

def findMax(arr):
maxSum = 0
for i in range(len(arr)):
val = arr.pop(0)
arr.append(val)
sum_ = [ele*j for j,ele in enumerate(arr)]
sum_ = sum(sum_)
if sum_ > maxSum:
maxSum = sum_
return maxSum

try:
arr = [int(ele) for ele in sys.argv.split(",")]
print(str(findMax(arr)))

except:
print('Usage: please provide a list of integers (e.g. "8, 3, 1, 2")')
``````

Maximum Array Rotation in Python was written by:

• Jeremy Grifski
• Tanisha Banik

If you see anything you’d like to change or update, please consider contributing.

Note: The solution shown above is the current solution in the Sample Programs repository as of May 10 2022 00:44:08. The solution was first committed on Oct 05 2021 20:54:14. As a result, documentation below may be outdated.

## How to Implement the Solution

No ‘How to Implement the Solution’ section available. Please consider contributing.

## How to Run the Solution

No ‘How to Run the Solution’ section available. Please consider contributing.