LeetCode
Question
·
Oct 2020
·
USA
Microsoft | OA 2020 | Max even sum of a subsequence of length K
10 upvotes
6,319 views
9 replies
Question Details
Given an array of integers A and an integer K, find a subsequence of length K that maximize the sum, which must be even. Return the sum, or -1 if...
Full Details
🔒
Unlock full leaked content
Full insider details, leaked discussions, and candidate experiences.
Get Premium →Topics
Arrays