Find Minimum Operations to Make All Elements Divisible by Three

You are given an integer array nums. In one operation, you can add or subtract 1 from any element of nums.

Return the minimum number of operations to make all elements of nums divisible by 3.

LeetCode Problem - 3190

class Solution {
    public int minimumOperations(int[] nums) {
        // Initialize result to store the total minimum operations
        int result = 0;

        // Iterate through each number in the array
        for(int i = 0; i < nums.length; i++) {
            // Calculate the remainder when the number is divided by 3
            int remainder = nums[i] % 3;

            // Calculate the minimum operations to make the number divisible by 3
            // This can be either reducing by the remainder or increasing by (3 - remainder)
            result += Math.min(remainder, 3 - remainder);
        }

        // Return the total minimum operations required
        return result;
    }
}