Will the time complexity be less than O(n^2) in this question ? If yes, then how in the hint video only max 2 endings are been considered .Moreover if only the max sum is the only criteria then why can’t we just take the max of all the sub blocks ?
Max Sum k - partition
Taking all sub blocks…is also O(n^2)
Sir, still not able to understand, how to do it .
Have a look here
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.