Available question text
Find the minimum number of single-unit decrements (each replaces nums[i] with nums[i]-1) needed to make the array sum divisible by k — since each operation reduces the total sum by 1, the answer equals sum(nums) % k (0 if already divisible).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3512. Minimum Operations to Make Array Sum Divisible by K
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source