Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Maximum Candies You Can Get from Boxes
Coding · Array · Breadth-First Search · Graph Theory
- Build Array Where You Can Find The Maximum Exactly K Comparisons
Coding
- Latest Time You Can Obtain After Replacing Characters
Coding
- Max Difference You Can Get From Changing an Integer
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Coupang
Leetcode 1423. Maximum Points You Can Obtain from Cards
Reported Aug 5, 2026 · 1 source report
STAFF
Source snapshot: Nov 12, 2026
View source