Find Minimum Operations to Make All Elements Divisible by Three

Easy
Watch on YouTube ↗

Solution

class Solution {
    public int minimumOperations(int[] nums) {
        

        int count = 0;

        for(int num : nums) {
            if(num%3!=0) {
                count++;
            }
        }

        return count;
    }
}


/*

num%3 

0, 1, 2

*/