LC-3190 Easy LeetCode

3190. Find Minimum Operations to Make All Elements Divisible by Three

Read the full problem statement on LeetCode.

Difficulty: easy Acceptance: 89% Topics: Array, Math

Reading material

Arrays & Hashing 12 min Math & Geometry 12 min

Reference solution (spoiler · python)

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

# math
class Solution(object):
    def minimumOperations(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        return sum(x%3 != 0 for x in nums)


# Time:  O(n)
# Space: O(1)
# math
class Solution2(object):
    def minimumOperations(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        return sum(min(x%3, 3-x%3) for x in nums)

Solution from kamyu104/LeetCode-Solutions · MIT