LeetCode 3512: Minimum Operations to Make Array Sum Divisible by K

Meta Data

#

Difficulty: easy First Attempt: 2025-04-12

• Total time: 01:00.00

Intuition

#

The problem need to count the minimum operations to make the array sum can de divided by K, thus we just need to find how many count we should do, means to get the reminder of nums and k

Approach

#

class Solution:
    def minOperations(self, nums: List[int], k: int) -> int:
        return sum(nums)%k

Findings

#

NA

Encountered Problems

#

NA