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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1423. Maximum Points You Can Obtain from Cards

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact