Code for painters problem

#1

hi, can i get the code for painters partition problem.

#2

hello @prashantrsj25

pls check it here->

we are using binary search.
the seach space is [ max time a painter takes … . . . . . . summation of all times]

the numberofPainters function is giving us minimum number of painter required to finish the work in maxlen time.
with the help of this function we are finding the minimum approriate time.

Painter's partition problem
#3

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.