i am not getting any correct and efficient approach
please give me some hints.
Maximum sum k-partition
Its a DP problem. Think of the parameters for the recursive function.
Its a selection problem with some condition (you need to consider array in divisions of k elements in each division).
If you are unable to think directly, write a recursive program first and then simply apply DP(Memorization).
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.