Subarray Sums Divisible by K
Given an integer array nums and an integer k, return the number of non-empty subarrays that have a sum divisible by k.
A subarray is a contiguous part of an array.
Example 1
Input
nums = [4,5,0,-2,-3,1], k = 5Output
7There are 7 subarrays with a sum divisible by k = 5: [4, 5, 0, -2, -3, 1], [5], [5, 0], [5, 0, -2, -3], [0], [0, -2, -3], and [-2, -3].
Example 2
Input
nums = [5], k = 9Output
0The only non-empty subarray is [5], and its sum is not divisible by 9.
Constraints
- 1 <= nums.length <= 3 * 10^4
- -10^4 <= nums[i] <= 10^4
- 2 <= k <= 10^4