LC-2216 Medium LeetCode

2216. Minimum Deletions to Make Array Beautiful

Read the full problem statement on LeetCode.

Difficulty: medium Acceptance: 49% Topics: Array, Stack, Greedy

Reading material

Arrays & Hashing 12 min Stacks & Queues 11 min Greedy 11 min

Reference solution (spoiler · python)

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

# greedy
class Solution(object):
    def minDeletion(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        result = 0
        for i in xrange(len(nums)-1):
            result += int(i%2 == result%2 and nums[i] == nums[i+1])
        return result+(len(nums)-result)%2

Solution from kamyu104/LeetCode-Solutions · MIT