Maximum Even Sum Subsequence

Problem Overview

• Find a subsequence whose sum is even and as large as possible, and output that even sum.
• Input: array of n integers (positive and negative); Output: maximum even sum; Constraints: N/A.
• Relevant to array processing and numeric data tasks.
• From Mathworks interviews; a common coding interview problem and interview question.