LeetCode Entry

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

22.11.2025 easy 2025 kotlin rust

Min steps inc/dec to make %3

3190. Find Minimum Operations to Make All Elements Divisible by Three easy blog post substack youtube

9e398533-0b61-4a05-b20f-168a4d7d0dcc (1).webp

Join me on Telegram

https://t.me/leetcode_daily_unstoppable/1181

Problem TLDR

Min steps inc/dec to make %3 #easy

Intuition

  • min(x%3, 3-x%3)

Approach

  • it is actually always min(1,2) = 1

Complexity

  • Time complexity: \(O(n)\)

  • Space complexity: \(O(1)\)

Code

// 1ms
    fun minimumOperations(n: IntArray) =
        n.count { it%3>0 }
// 0ms
    pub fn minimum_operations(n: Vec<i32>) -> i32 {
        n.iter().filter(|&x| x%3>0).count() as _
    }