LC-3096 Medium LeetCode

3096. Minimum Levels to Gain More Points

Read the full problem statement on LeetCode.

Difficulty: medium Acceptance: 39% Topics: Array, Prefix Sum

Reading material

Arrays & Hashing 12 min Prefix Sums & Difference Arrays 11 min

Reference solution (spoiler · python)

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

# prefix sum
class Solution(object):
    def minimumLevels(self, possible):
        """
        :type possible: List[int]
        :rtype: int
        """
        prefix = [0]*(len(possible)+1)
        for i in xrange(len(possible)):
            prefix[i+1] = prefix[i]+(+1 if possible[i] else -1)
        return next((i+1 for i in xrange(len(possible)-1) if prefix[i+1] > prefix[-1]-prefix[i+1]), -1)

Solution from kamyu104/LeetCode-Solutions · MIT