Subarray Sums Divisible by K

Given an integer array nums and an integer k, count the number of non-empty subarrays whose sum is divisible by k.

Input Format

nums = array of integers, k = integer

Output Format

Number of subarrays with sum divisible by k

Constraints

  • 1 <= nums.length <= 3*10^4; -10^4 <= nums[i] <= 10^4; 1 <= k <= 1000

Examples

Example 1:

Input:

nums = [4,5,0,-2,-3,1]
k = 5

Output:

7

Explanation:

There are 7 such subarrays.

Loading...
Subarray Sums Divisible by K - Arrays