Please tell me how to approach this problem, I can’t work it out
Can't think of an approach
hello @jayasmit98 Through the concept of this question you can learn about binary search trick .
in this question you have to apply binary search on the time the painters have .
suppose you have painters equal to the number of boards then the time taa=ken will be the max size of board in the array otherwise the time taken by them would be in between max board in the array to the sum of all the elements .
in this way you can apply the binary search on this question .
please ask here if you have any doubt .
Happy Learning !!