InterviewBit Academy is now Scaler!
Learn Tech Skills from Scratch @ Scaler EDGE

Balance Array


Problem Description

Given an integer array A of size N. You need to count the number of special elements in the given array.

A element is special if removal of that element make the array balanced.

Array will be balanced if sum of even index element equal to sum of odd index element.



Problem Constraints

1 <= N <= 105

1 <= A[i] <= 109



Input Format

First and only argument is an integer array A of size N.



Output Format

Return an integer denoting the count of special elements.



Example Input

Input 1:

 A = [2, 1, 6, 4]

Input 2:

 A = [5, 5, 2, 5, 8]



Example Output

Output 1:

 1

Output 2:

 2



Example Explanation

Explanation 1:

 After deleting 1 from array : {2,6,4}
    (2+4) = (6)
 Hence 1 is the only special element, so count is 1

Explanation 2:

 If we delete A[0] or A[1] , array will be balanced
    (5+5) = (2+8)
 So A[0] and A[1] are special elements, so count is 2.



NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.
Start solving Balance Array on Interview Code Editor
Sign Up
to access hints and editorial solutions for Balance Array
Asked In:

Discussion


Loading...
Click here to start solving coding interview questions