Given an array **arr[]** of integers, the task is to find the total count of subarrays such that the sum of elements at even position and sum of elements at the odd positions are equal.

**Examples:**

Input:arr[] = {1, 2, 3, 4, 1}Output:1Explanation:

{3, 4, 1} is the only subarray in which sum of elements at even position {3, 1} = sum of element at odd position {4}

Input:arr[] = {2, 4, 6, 4, 2}Output:2Explanation:

There are two subarrays {2, 4, 6, 4} and {4, 6, 4, 2}.

**Approach:** The idea is to generate all possible subarrays. For each subarray formed find the sum of the elements at even index and subtract the elements at odd index. If the sum is 0, count this subarray else check for the next subarray.

Below is the implementation of the above approach:

## Java

`// Java program for the above approach ` `import` `java.util.*; ` `class` `GFG { ` ` ` ` ` `// Function to count subarrays in ` ` ` `// which sum of elements at even ` ` ` `// and odd positions are equal ` ` ` `static` `void` `countSubarrays(` `int` `arr[], ` ` ` `int` `n) ` ` ` `{ ` ` ` `// Initialize variables ` ` ` `int` `count = ` `0` `; ` ` ` ` ` `// Iterate over the array ` ` ` `for` `(` `int` `i = ` `0` `; i < n; i++) { ` ` ` `int` `sum = ` `0` `; ` ` ` ` ` `for` `(` `int` `j = i; j < n; j++) { ` ` ` ` ` `// Check if position is ` ` ` `// even then add to sum ` ` ` `// then add it to sum ` ` ` `if` `((j - i) % ` `2` `== ` `0` `) ` ` ` `sum += arr[j]; ` ` ` ` ` `// else subtract it to sum ` ` ` `else` ` ` `sum -= arr[j]; ` ` ` ` ` `// Increment the count ` ` ` `// if the sum equals 0 ` ` ` `if` `(sum == ` `0` `) ` ` ` ` ` `count++; ` ` ` `} ` ` ` `} ` ` ` ` ` `// Print the count of subarrays ` ` ` `System.out.println(count); ` ` ` `} ` ` ` ` ` `// Driver Code ` ` ` `public` `static` `void` ` ` `main(String[] args) ` ` ` `{ ` ` ` `// Given array arr[] ` ` ` `int` `arr[] = { ` `2` `, ` `4` `, ` `6` `, ` `4` `, ` `2` `}; ` ` ` ` ` `// Size of the array ` ` ` `int` `n = arr.length; ` ` ` ` ` `// Function call ` ` ` `countSubarrays(arr, n); ` ` ` `} ` `}` |

*chevron_right*

*filter_none*

## Python3

`# Python3 program for the above approach ` ` ` `# Function to count subarrays in ` `# which sum of elements at even ` `# and odd positions are equal ` `def` `countSubarrays(arr, n): ` ` ` ` ` `# Initialize variables ` ` ` `count ` `=` `0` ` ` ` ` `# Iterate over the array ` ` ` `for` `i ` `in` `range` `(n): ` ` ` `sum` `=` `0` ` ` ` ` `for` `j ` `in` `range` `(i, n): ` ` ` ` ` `# Check if position is ` ` ` `# even then add to sum ` ` ` `# hen add it to sum ` ` ` `if` `((j ` `-` `i) ` `%` `2` `=` `=` `0` `): ` ` ` `sum` `+` `=` `arr[j] ` ` ` ` ` `# else subtract it to sum ` ` ` `else` `: ` ` ` `sum` `-` `=` `arr[j] ` ` ` ` ` `# Increment the count ` ` ` `# if the sum equals 0 ` ` ` `if` `(` `sum` `=` `=` `0` `): ` ` ` `count ` `+` `=` `1` ` ` ` ` `# Print the count of subarrays ` ` ` `print` `(count) ` ` ` `# Driver Code ` `if` `__name__ ` `=` `=` `'__main__'` `: ` ` ` ` ` `# Given array arr[] ` ` ` `arr ` `=` `[ ` `2` `, ` `4` `, ` `6` `, ` `4` `, ` `2` `] ` ` ` ` ` `# Size of the array ` ` ` `n ` `=` `len` `(arr) ` ` ` ` ` `# Function call ` ` ` `countSubarrays(arr, n) ` ` ` `# This code is contributed by mohit kumar 29` |

*chevron_right*

*filter_none*

## C#

`// C# program for the above approach ` `using` `System; ` ` ` `class` `GFG{ ` ` ` `// Function to count subarrays in ` `// which sum of elements at even ` `// and odd positions are equal ` `static` `void` `countSubarrays(` `int` `[]arr, ` `int` `n) ` `{ ` ` ` ` ` `// Initialize variables ` ` ` `int` `count = 0; ` ` ` ` ` `// Iterate over the array ` ` ` `for` `(` `int` `i = 0; i < n; i++) ` ` ` `{ ` ` ` `int` `sum = 0; ` ` ` ` ` `for` `(` `int` `j = i; j < n; j++) ` ` ` `{ ` ` ` ` ` `// Check if position is ` ` ` `// even then add to sum ` ` ` `// then add it to sum ` ` ` `if` `((j - i) % 2 == 0) ` ` ` `sum += arr[j]; ` ` ` ` ` `// else subtract it to sum ` ` ` `else` ` ` `sum -= arr[j]; ` ` ` ` ` `// Increment the count ` ` ` `// if the sum equals 0 ` ` ` `if` `(sum == 0) ` ` ` `count++; ` ` ` `} ` ` ` `} ` ` ` ` ` `// Print the count of subarrays ` ` ` `Console.WriteLine(count); ` `} ` ` ` `// Driver Code ` `public` `static` `void` `Main(String[] args) ` `{ ` ` ` ` ` `// Given array []arr ` ` ` `int` `[]arr = { 2, 4, 6, 4, 2 }; ` ` ` ` ` `// Size of the array ` ` ` `int` `n = arr.Length; ` ` ` ` ` `// Function call ` ` ` `countSubarrays(arr, n); ` `} ` `} ` ` ` `// This code is contributed by 29AjayKumar ` |

*chevron_right*

*filter_none*

**Output:**

2

**Time Complexity:*** O(N ^{2})*

**Auxiliary Space:**

*O(1)*

## Recommended Posts:

- Count subarrays with equal number of occurrences of two given elements
- Number of ways to select equal sized subarrays from two arrays having atleast K equal pairs of elements
- Count subarrays with sum equal to its XOR value
- Count subarrays such that remainder after dividing sum of elements by K gives count of elements
- Count subarrays with equal number of 1's and 0's
- Make sum of all subarrays of length K equal by only inserting elements
- Count of subarrays whose product is equal to difference of two different numbers
- Count subarrays with same even and odd elements
- Count of subarrays having exactly K distinct elements
- Count subarrays with all elements greater than K
- Count of subarrays of size K with elements having even frequencies
- Count Subarrays with Consecutive elements differing by 1
- Count of subarrays which forms a permutation from given Array elements
- Count subarrays having total distinct elements same as original array
- Count of Array elements to be divided by 2 to make at least K elements equal
- Count elements such that there are exactly X elements with values greater than or equal to X
- Count sub-arrays which have elements less than or equal to X
- Count of elements which are equal to the XOR of the next two elements
- Count elements less than or equal to a given value in a sorted rotated array
- Count of index pairs with equal elements in an array

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.