Painter Partition Problem

[PawandeepKaur2405]

Is your feature request related to a problem? Please describe. Problem name : Painter partition problem Difficulty level : HARD Given length of N different boards and M painter available, a painter paints 1 unit of board in 1 unit of time and each painter will paint consecutive boards. Find the minimum time that will be required to paint all the boards.

Describe the solution you'd like Kindly assign me this issue @Saurabh4626 sir. I would like to add my solution to this problem. Additional context Link to this on GFG practice portal: Problem Link

Programming language

• [ ] C
• [x] C++
• [ ] Java
• [ ] Python

[PawandeepKaur2405]

@Saurabh4626 @ravikr126 @Ayush7614 Please Assign me this issue. I want to solve it in C++ LGM-SOC'21

Thank You