LC-1186 Medium LeetCode

1186. Maximum Subarray Sum with One Deletion

Read the full problem statement on LeetCode.

Difficulty: medium Acceptance: 45% Topics: Array, Dynamic Programming

Reading material

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

Reference solution (spoiler · python)

class Solution(object):
    def maximumSum(self, arr):
        """
        :type arr: List[int]
        :rtype: int
        """
        result, prev, curr = float("-inf"), float("-inf"), float("-inf")
        for x in arr:
            curr = max(prev, curr+x, x)
            result = max(result, curr)
            prev = max(prev+x, x)
        return result

Solution from kamyu104/LeetCode-Solutions · MIT