Problem Brief

Find Maximum Even Sum

FULLTIMEOA

The goal is to find the maximum possible even sum of values of tags that can be chosen.

Note:

It is guaranteed that there is at least one tag with an even value.

The tags can have positive or negative values.

It can be possible to choose no tags at all.

1Example 1

Input

val = [2, 3, 6, -5, 10, 1, 1]

Output

Explanation

The tags [2, 3, 6, 10, 1] sum to 22 which is even and is the maximum possible. Hence, the answer is 22.

Limits and guarantees your solution can rely on.

🥑🥑

Draft autosaves locally

public int findMaximumEvenSum(int[] val) {
  // write your code here
}

Input

val

[2, 3, 6, -5, 10, 1, 1]

Output