← All problemsSign in

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

LeetCodeArrayMathOpen on judge ↗

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. Example 1: Input: nums = [1,2,3,4] Output: 3 Explanation: All array elements can be made divisible by 3 using 3 operations: - Subtract 1 from 1. - Add 1 to 2. - Subtract 1 from 4. Example 2: Inpu

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start