2025-08-22 18:25:20 +0300 MSK

Divide an Array Into Subarrays With Minimum Cost I
Tags:

Code

class Solution:
    def minimumCost(self, nums: List[int]) -> int:
        nums.reverse()
        first = nums.pop()
        nums.sort()
        return first + sum(nums[:2])