LC-0410 Hard LeetCode

410. Split Array Largest Sum

Array Binary Search Dynamic Programming Greedy Prefix Sum

Read the full problem statement on LeetCode.

Difficulty: hard Acceptance: 58% Topics: Array, Binary Search, Dynamic Programming, Greedy, Prefix Sum

Reading material

Arrays & Hashing 12 min Binary Search 12 min 1-D Dynamic Programming 16 min

Reference solution (spoiler · python)

# Time:  O(nlogs), s is the sum of nums
# Space: O(1)

class Solution(object):
    def splitArray(self, nums, m):
        """
        :type nums: List[int]
        :type m: int
        :rtype: int
        """
        def check(nums, m, s):
            cnt, curr_sum = 1, 0
            for num in nums:
                curr_sum += num
                if curr_sum > s:
                    curr_sum = num
                    cnt += 1
            return cnt <= m

        left, right = max(nums), sum(nums)
        while left <= right:
            mid = left + (right - left) // 2
            if check(nums, m, mid):
                right = mid - 1
            else:
                left = mid + 1
        return left

Solution from kamyu104/LeetCode-Solutions · MIT