[FEATURE REQUEST] <title> Painter's problem a Dynamic prrogramming Problem

[zenith-78]

What would you like to Propose?

I would like to add a classical Dynamic programming problem i.e. Painter's Problem which is based on the Important concept of Partitions to the Dynamic programming repository.

Issue details

Problem Statement :

Given there are N boards given as array of size n , and K painters.
Each painter Takes exactly 1 unit of time to paint 1 unit of a board. Each element in array represents the size of the boards. The task is to find the minimum amout of time to paint all the boards with the constraint of painter can only paint contiguous sections of the boards.
The submitted code would contain the methods required for calculating the time for painting the boards . The methods are also supported by java doc Strings which specifies the input and the return parameter for the added methods.

Additional Information

please assign it under the HACKTOCTOBER label

[shashankrp]

I will like to work on this issue please assign this issue to me.

[github-actions]

This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contribution!

[github-actions]

Please reopen this issue once you have made the required changes. If you need help, feel free to ask in our Discord server or ping one of the maintainers here. Thank you for your contribution!