Find Maximum Even Sum

Find Maximum Even Sum is an Ibm interviews coding interview problem. Given a list of tag values (positive or negative), determine the maximum possible even sum obtainable by selecting any subset of tags. You may also choose no tags. It’s guaranteed at least one tag has an even value. A concise interview question that checks understanding of sums in a practical problem.