_3190. Find Minimum Operations to Make All Elements Divisible by Three.md

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

All prompts are owned by LeetCode. To view the prompt, click the title link above.

Back to top

---

First completed : June 22, 2024

Last updated : June 22, 2024

---

Related Topics : Array, Math

Acceptance Rate : 89.11 %

---

Solutions

• e3190.java

Java

e3190.java

class Solution {
    public int minimumOperations(int[] nums) {
        int turns = 0;
        for (int num : nums) {
            if (num % 3 != 0) {
                turns += 1;
            }
        }

        return turns;
    }
}