Painter's Partition Problem Statement

Given an array/list representing boards, where each element denotes the length of a board, and a number ‘K’ of available painters, determine the minimum time required to paint all boards. Each unit length of the board requires 1 unit of time. A painter can only paint continuous sections of boards.

Example:

Input:

ARR = {2, 1, 5, 6, 2, 3}
K = 3

Output:

7

Explanation:

Painters can paint the boards in such a way that minimizes the maximum time any painter spends painting: one potential distribution is {2, 1, 5}, {6}, {2, 3}, where the maximum time is 7.

Constraints:

• 1 <= T <= 5
• 1 <= N <= 10⁴
• 1 <= K <= N
• 1 <= ARR[i] <= 10⁵

Where:

• T is the number of test cases.
• N is the length of the given array/list (boards).
• K is the number of painters available.
• ARR[i] denotes the i-th element in the array/list.

Time Limit: 1 sec.

Note:

You do not need to print anything; it is already managed. Just implement the function and return the answer.