1192. Divide Chocolate

After dividing the array into K+1 sub-arrays, you will pick the sub-array with the minimum sum.

Divide the sub-array into K+1 sub-arrays such that the minimum sub-array sum is as maximum as possible.

Use binary search with greedy check.