NOT GETTING INTUTION .PLEASE EXPLAIN IN EASY WAY
Max sum k partition
Hey @S18LPC-OL0078
This is one of the hardest problem on the contest. So I would suggest you to solve other problems before coming back to it.
The approach is this way, In every group of size K in array, find mx and second mx sum so far. Then in next K elements you can add either mx or second mx sum depending on index where they were obtained. Keep on doing this till the end.
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.