LeetCode 3013 Solution: Divide an Array Into Subarrays With Minimum Cost II
You’re given a 0‑indexed array nums (length n) and two integers k and dist. You must split nums into k disjoint contiguous subarrays. The cost of any subarray is simply its first element. You also have a constraint on where the later subarrays can start: If the subarrays start at indices 0 = s0 < … Read more