Leetcode 1231. Divide Chocolate

Given an array of sweetness values for sequential chocolate chunks, partition it into k+1 contiguous pieces so as to maximize the minimum total sweetness among the pieces. This is a maximin partitioning problem usually solved by binary-searching the answer with a greedy feasibility check.