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

Compute each element's remainder mod 3 and for each add the minimum moves to reach 0 (min(r, 3−r)), which reduces here to counting all elements with remainder 1 or 2 — their count is the minimum number of ±1 operations needed.