// 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. int Solution::solve(vector &A) { int n=A.size(); int od[n]={0}; int ev[n]={0}; od[0]=A[0]; if(n>=2) od[1]=od[0]; for(int i=2;i=2) ev[1]=A[1]; if(n>=3) ev[2]=ev[1]; for(int i=3;i