Leetcode 410. Split Array Largest Sum

Split the array into k non-empty contiguous subarrays so that the maximum subarray sum is as small as possible, and return that minimized largest sum. This is a partitioning/optimization problem typically solved with binary search on the answer (or DP) and a greedy feasibility check.