Leetcode 396. Rotate Function

[whatuphere]

legendary intro, masterful explanation, GANGGGG!!

[prathamsharma]

I'm with the gang gang gang gang, boys hoppin out the coupe

[chinmaypanchal]

Thankyou sir god bless you

Here is the c++ code O(n):

class Solution {
public:
int array) {
int n = array.size();
int prevsol = 0; int arraysum = 0;
for(int i=0;i<n; i++){
prevsol = prevsol+(i*array[i]);
arraysum = arraysum+array[i];
}

int maxsum = prevsol;
for(int i=n-1; i>=1; i--){
prevsol = prevsol + arraysum - (n*array[i]);
if(maxsum<prevsol){
maxsum = prevsol;
}
}
return maxsum;
}
};

[MOHITRANA-torf]

love the college professor part.
need more

[preetu]

great explanation. btw what board are you using?