Max sum k partition

#1

Didnt understand the question.please explain

#2

The question is basically trying to tell u that size of the block will be either k or in case there are less than k elements then the block size will be min(i+k , n-i)such that there is no overflow
i is the index of the cell from where the block will start
n is the max array size
like
suppose the array is
1 2 3 5 6 7 8 9
size = 8
k = 3
so the blocks will eb
1 2 3
5 6 7
8 9 ( less than k ) sized block

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.