โ† Amazon questions

Max sum of i * array[i] with rotations

Filed under Amazon

Given an array of integers, find the maximum possible sum of `i * array[i]` among all possible rotations of the array, running in O(n) time complexity.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Amazon questions

Collected from public candidate posts and coding forums. Updated Nov 2026.