Leetcode 1423. Maximum Points You Can Obtain from Cards
Choose exactly k cards from either end of an array to maximize the sum; equivalently, remove a contiguous subarray of length n−k with minimum sum, which suggests an O(n) sliding-window solution.
Asked at:
Coupang
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
Early August, 2026
Staff
Asked as it is
Hello Interview Premium
Your account is free and you can post anonymously if you choose.