LC-2038 Medium LeetCode

2038. Remove Colored Pieces if Both Neighbors are the Same Color

Read the full problem statement on LeetCode.

Difficulty: medium Acceptance: 63% Topics: Math, String, Greedy, Game Theory

Reading material

Math & Geometry 12 min Strings 12 min Greedy 11 min

Reference solution (spoiler · python)

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

class Solution(object):
    def winnerOfGame(self, colors):
        """
        :type colors: str
        :rtype: bool
        """
        cnt1 = cnt2 = 0
        for i in xrange(1, len(colors)-1):
            if not (colors[i-1] == colors[i] == colors[i+1]):
                continue
            if colors[i] == 'A':
                cnt1 += 1
            else:
                cnt2 += 1
        return cnt1 > cnt2

Solution from kamyu104/LeetCode-Solutions · MIT