Given an unsorted array arr of N integers and a sum. The task is to count the number of subarray which adds to a given number.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case contains an integer N denoting the size of the array. The next line contains N space separated integers forming the array. The last line contains an integer denoting the value of the sum.
For each testcase, in a new line, print the count of the subarray which adds to the given sum.
This is a function problem. You only need to complete the function subArraySum() that takes arr, n, sum as parameters and returns the count.
1 <= T <= 200
1 <= N <= 105
-105 <= arr[i] <= 105
-105 <= sum <= 105
10 2 -2 -20 10
1 4 20 3 10 5
Testcase 1: Subarrays with sum -10 are: [10, 2, -2, -20], [2, -2, -20, 10] and [-20, 10].
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.