Given an array arr[] of length n and an integer k, the task is to find the number of indices from 2 to n-1 in the array having a difference of the sum of left and right sub array equal to the multiple of given number k.
Examples:
Input: arr[] = {1, 2, 3, 3, 1, 1}, k = 4
Output: 2
Explanation: The only possible indices are 4 and 5Input: arr[] = {1, 2, 3, 4, 5}, k = 1
Output: 3
Approach:
- Create a prefix array which contains the sum of the elements in the left and the suffix array which contains the sum of elements in the right.
- Check for every index the difference of sum in the left and right and increase the counter if it is divisible by k
Below is the implementation of the above approach:
CPP
// C++ code to count of elements such that // difference between the sum of left and right // sub-arrays are equal to a multiple of k #include <bits/stdc++.h> using namespace std; // Functions to find the no of elements int noOfElement(int a[], int n, int k) { // Creating a prefix array int prefix[n]; // Starting element of prefix array // will be the first element // of given array prefix[0] = a[0]; for (int i = 1; i < n; i++) { prefix[i] = prefix[i - 1] + a[i]; } // Creating a suffix array; int suffix[n]; // Last element of suffix array will // be the last element of given array suffix[n - 1] = a[n - 1]; for (int i = n - 2; i >= 0; i--) { suffix[i] = suffix[i + 1] + a[i]; } // Checking difference of left and right half // is divisible by k or not. int cnt = 0; for (int i = 1; i < n - 1; i++) { if ((prefix[i] - suffix[i]) % k == 0 || (suffix[i] - prefix[i]) % k == 0) { cnt = cnt + 1; } } return cnt; } // Driver code int main() { int a[] = { 1, 2, 3, 3, 1, 1 }; int k = 4; int n = sizeof(a) / sizeof(a[0]); cout << noOfElement(a, n, k); return 0; } |
chevron_right
filter_none
Java
// Java code to count of elements such that // difference between the sum of left and right // sub-arrays are equal to a multiple of k class GFG { // Functions to find the no of elements static int noOfElement(int a[], int n, int k) { // Creating a prefix array int []prefix = new int[n]; // Starting element of prefix array // will be the first element // of given array prefix[0] = a[0]; for (int i = 1; i < n; i++) { prefix[i] = prefix[i - 1] + a[i]; } // Creating a suffix array; int []suffix = new int[n]; // Last element of suffix array will // be the last element of given array suffix[n - 1] = a[n - 1]; for (int i = n - 2; i >= 0; i--) { suffix[i] = suffix[i + 1] + a[i]; } // Checking difference of left and right half // is divisible by k or not. int cnt = 0; for (int i = 1; i < n - 1; i++) { if ((prefix[i] - suffix[i]) % k == 0 || (suffix[i] - prefix[i]) % k == 0) { cnt = cnt + 1; } } return cnt; } // Driver code public static void main(String[] args) { int a[] = { 1, 2, 3, 3, 1, 1 }; int k = 4; int n = a.length; System.out.print(noOfElement(a, n, k)); } } // This code is contributed by Rajput-Ji |
chevron_right
filter_none
Python
# Python3 code to count of elements such that # difference between the sum of left and right # sub-arrays are equal to a multiple of k # Functions to find the no of elements def noOfElement(a, n, k): # Creating a prefix array prefix = [0] * n # Starting element of prefix array # will be the first element # of given array prefix[0] = a[0] for i in range(1, n): prefix[i] = prefix[i - 1] + a[i] # Creating a suffix array suffix = [0] * n # Last element of suffix array will # be the last element of given array suffix[n - 1] = a[n - 1] for i in range(n - 2, -1, -1): suffix[i] = suffix[i + 1] + a[i] # Checking difference of left and right half # is divisible by k or not. cnt = 0 for i in range(1, n - 1): if ((prefix[i] - suffix[i]) % k == 0 or (suffix[i] - prefix[i]) % k == 0): cnt = cnt + 1 return cnt # Driver code a = [ 1, 2, 3, 3, 1, 1 ] k = 4n = len(a) print(noOfElement(a, n, k)) # This code is contributed by mohit kumar 29 |
chevron_right
filter_none
C#
// C# code to count of elements such that // difference between the sum of left and right // sub-arrays are equal to a multiple of k using System; class GFG { // Functions to find the no of elements static int noOfElement(int []a, int n, int k) { // Creating a prefix array int []prefix = new int[n]; // Starting element of prefix array // will be the first element // of given array prefix[0] = a[0]; for (int i = 1; i < n; i++) { prefix[i] = prefix[i - 1] + a[i]; } // Creating a suffix array; int []suffix = new int[n]; // Last element of suffix array will // be the last element of given array suffix[n - 1] = a[n - 1]; for (int i = n - 2; i >= 0; i--) { suffix[i] = suffix[i + 1] + a[i]; } // Checking difference of left and right half // is divisible by k or not. int cnt = 0; for (int i = 1; i < n - 1; i++) { if ((prefix[i] - suffix[i]) % k == 0 || (suffix[i] - prefix[i]) % k == 0) { cnt = cnt + 1; } } return cnt; } // Driver code public static void Main() { int []a = { 1, 2, 3, 3, 1, 1 }; int k = 4; int n = a.Length; Console.Write(noOfElement(a, n, k)); } } // This code is contributed by AnkitRai01 |
chevron_right
filter_none
Output:
2
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
Recommended Posts:
- Find the difference of count of equal elements on the right and the left for each element
- Count sub-arrays which have elements less than or equal to X
- Check if two arrays can be made equal by reversing subarrays multiple times
- Count of Array elements greater than all elements on its left and at least K elements on its right
- Number of ways to select equal sized subarrays from two arrays having atleast K equal pairs of elements
- Count of array elements which are greater than all elements on its left
- Count smaller elements on right side and greater elements on left side using Binary Index Tree
- Count of elements on the left which are divisible by current element | Set 2
- Count of elements on the left which are divisible by current element
- Maximum count of elements divisible on the left for any element
- Count of elements in an Array whose set bits are in a multiple of K
- Count of Array elements to be divided by 2 to make at least K elements equal
- Count equal pairs from given string arrays
- Count pairs from two sorted arrays whose sum is equal to a given value x
- Find maximum difference between nearest left and right smaller elements
- Count elements such that there are exactly X elements with values greater than or equal to X
- Divide array in two maximum equal length arrays of similar and dissimilar elements
- Count of elements which are equal to the XOR of the next two elements
- Maximize count of corresponding same elements in given Arrays by Rotation
- Count of arrays in which all adjacent elements are such that one of them divide the another
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
