Chetan Dattachetan77.hashnode.dev·May 5, 2024410. Split Array Largest SumProblem Given an integer array nums and an integer k, split nums into k non-empty subarrays such that the largest sum of any subarray is minimized. Return the minimized largest sum of the split. A subarray is a contiguous part of the array. (link) Ex...DiscussLeetcodesplit-array-largest-sum
