LC-2555 Medium LeetCode

2555. Maximize Win From Two Segments

Read the full problem statement on LeetCode.

Difficulty: medium Acceptance: 35% Topics: Array, Binary Search, Sliding Window

Reading material

Arrays & Hashing 12 min Binary Search 12 min Sliding Window 11 min

Reference solution (spoiler · python)

# Time:  O(n)
# Space: O(n)

# two pointers, sliding window, dp
class Solution(object):
    def maximizeWin(self, prizePositions, k):
        """
        :type prizePositions: List[int]
        :type k: int
        :rtype: int
        """
        dp = [0]*(len(prizePositions)+1)
        result = left = 0
        for right in xrange(len(prizePositions)):
            while prizePositions[right]-prizePositions[left] > k:
                left += 1
            dp[right+1] = max(dp[right], right-left+1)
            result = max(result, dp[left]+(right-left+1))
        return result

Solution from kamyu104/LeetCode-Solutions · MIT