Problem of The Day: Find Minimum Operations to Make All Elements Divisible by Three

Problem Statement

leetcode problem link

Brute Force [Accepted]

class Solution:
    def minimumOperations(self, nums: List[int]) -> int:
        res = 0
        arr = []
        for num in nums:
            if num % 3 != 0:
                arr.append(num)

        for x in arr:
            temp = x
            count1 = 0
            while temp % 3 != 0:
                temp += 1
                count1 += 1
            temp = x
            count2 = 0
            while temp % 3 != 0:
                temp -= 1
                count2 += 1

            res += min(count1, count2)

        return res
        ```

Editorial

class Solution:
    def minimumOperations(self, nums: List[int]) -> int:
        return sum(min(x % 3, 3 - x % 3) for x in nums)