BETA

Difficulty Level:

Basic

Total Submissions: 759 Accuracy:

20.55%

Max Odd Sum
     

Given an array of integers, check whether there is a subsequence with odd sum and if yes, then finding the maximum odd sum. If no subsequence contains odd sum, print -1.

Input:
First line of input contains a single integer T which denotes the number of test cases. Then T test cases follows. First line of each test case contains a single integer N which denotes the number of elements in the array. Second line of each test case contains N space separated integers.

Output:
For each test case print the maximum odd sum that can be obtained from any subsequence of the given array. If no subsequence contains odd sum, print -1.

Constraints:
1<=T<=100
1<=N<=104

Example:
Input:
3
5
2 5 -4 3 -1
4
4 -3 3 -5
3
2 4 6
Output:
9
7
-1

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Harsh Agarwal

Set Default Code

					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.