Split array largest sum
Your task
Given an integer array nums and an integer k, split nums into exactly k non-empty CONTIGUOUS subarrays. Minimize the largest sum among the k subarrays, and return that minimized largest sum. Constraints: 1 <= k <= len(nums) <= 1000, 0 <= nums[i] <= 10^6.
Examples
split_array_min_largest_sum(nums: list[int], k: int) -> intExample 1
Input
split_array_min_largest_sum([7, 2, 5, 10, 8], 2)Output
18