Showing:
Handle Score
@Ibrahim Nash 5725
@akhayrutdinov 5111
@mb1973 4989
@Quandray 4908
@saiujwal13083 4156
@sanjay05 3762
@marius_valentin_dragoi 3511
@sushant_a 3453
@KshamaGupta 3318
@the_coder95 3302
Sub-Array sum divisible by K
Easy Accuracy: 27.31% Submissions: 377 Points: 2

You are given an array A of N positive and/or negative integers and a value K. The task is to find the count of all sub-arrays whose sum is divisible by K.

Example 1:

Input: N = 6, K = 5
arr[] = {4, 5, 0, -2, -3, 1}
Output: 7
Explanation: There are 7 sub-arrays whose
is divisible by K {4, 5, 0, -2, -3, 1}, {5},
{5, 0}, {5, 0, -2, -3}, {0}, {0, -2, -3}
and {-2, -3}


Example 2:

Input: N = 6, K = 2
arr[] = {2, 2, 2, 2, 2, 2}
Output: 21
Explanation: All subarray sums are
divisible by 7



This is a function problem. You don't need to take any input, as it is already accomplished by the driver code. You just need to complete the function subCount() that takes array arr, integer N, and integeras parameters and returns the desired output.

Expected Time Complexity: O(N+K).
Expected Auxiliary Space: O(K).

Constraints:
2 ≤ N ≤ 105