Discount Tags

Problem Overview

• Select a subset of tags so the total value is even and as large as possible.
• Input: val[] (integers, positive or negative, at least one even); Output: int maximum even sum; choosing no tags is allowed.
• Real-world context: picking discount tags in HackerMall to qualify for coupons.
• Source: Mathworks interviews; a coding interview problem and interview question.