Question $22$

Max. score: $20\mathrm{.}00$

orrect pair sum

Given an integer array $A$ of the size $N.$ Find the sum of values in the

array that has different parity from that of their index in the array.

Calculate the sum of values of $A[i]$ for all i where,

$A[i]mod2$imod$2$

Note: $1-$based indexing is used.

Function description

Complete the function solve. This function takes the following

$2$ parameters $N,$ and $A,$ and returns an integer output:

$N$ : Represents the number of array elements

A: Represents the integer array $A$

Input format for custom testing

Note: Use this input format if you are testing against custom input or

writing code in a language where we don't provide boilerplate code.

The first line rontains a sinnle intener I denotina the total Note: Use this input format if you are testing against custom input or

writing code in a language where we don't provide boilerplate code.

The first line contains a single integer $T$ denoting the total

number of test cases.

For each test case:

The first line of each test case contains a single integer

$N.$

The second line of each test case contains $N$ space$-$

separated integers representing the array $A.$

Output format

For each test case in a new line, print a single integer denoting the

answer to the test case.

Constraints

$1T10$

$1N{10}^5$

$1A_i{10}^2$

Sum of $N$ for all test cases ${10}^5$ Sample input

$2$

$3$

$123$

$4$

$2345$

Explanation

The first line contains $T$ denoting the number of test cases, here $T=2.$

For the first test case

Given

$N=3$

$A=[1,2,3]$

Approach

For $i=1,$ you have $A[i]=1,1$mod$2=1$ and imod$2=1$ Do not add it to

the answer.

For $1=2,$ you have $A(i)=2,2$mod$2=0$ and $1$mod$2=0.$ Do not add it