i can’t understand where dp is used in this problem?
what is optimal substructure of this problem?
Max Sum K partition
Hey @dhruv.160410116084
This is actually a very difficult problem. So I recommend you see the solution and use this knowledge to solve further questions. https://ide.codingblocks.com/s/185478
If your doubt is resolved please mark it as closed.
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.