Given an integer array nums, define the rotation function F(k) as the sum of i * nums[(i + k) % n] for each index i, where n is the length of nums.

Return the maximum value of F(k) over all possible rotations k.

Constraints:

• n == nums.length

• 1 <= n <= 10^5

• -100 <= nums[i] <= 100

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.