LeetCode Entry

3512. Minimum Operations to Make Array Sum Divisible by K

29.11.2025 easy 2025 kotlin rust

Sum % k

3512. Minimum Operations to Make Array Sum Divisible by K easy blog post substack youtube

Join me on Telegram

https://t.me/leetcode_daily_unstoppable/1188

Problem TLDR

Sum % k #easy

Intuition

The number of operations is the remainder of %k

Approach

• %k

Complexity

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

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

Code

// 11ms
    fun minOperations(n: IntArray, k: Int) =
        n.sum() % k

// 0ms
    pub fn min_operations(n: Vec<i32>, k: i32) -> i32 {
        n.iter().sum::<i32>() % k
    }