{"id":934,"date":"2025-08-20T13:45:50","date_gmt":"2025-08-20T08:15:50","guid":{"rendered":"https:\/\/codeanddebug.in\/blog\/?p=934"},"modified":"2025-08-20T13:45:51","modified_gmt":"2025-08-20T08:15:51","slug":"maximum-points-you-can-obtain-from-cards","status":"publish","type":"post","link":"https:\/\/codeanddebug.in\/blog\/maximum-points-you-can-obtain-from-cards\/","title":{"rendered":"Maximum Points You Can Obtain from Cards | Leetcode 1423"},"content":{"rendered":"\n

The problem\u00a0\u201cMaximum Points\u00a0You Can Obtain\u00a0from Cards\u201d<\/strong>\u00a0asks\u00a0you to pick exactly\u00a0k<\/strong>\u00a0cards from\u00a0either the\u00a0start<\/strong>\u00a0or the\u00a0end<\/strong>\u00a0of the\u00a0array\u00a0cardPoints<\/code>\u00a0to\u00a0maximize the\u00a0total points. The key insight\u00a0is that if you\u00a0must pick\u00a0k<\/strong>\u00a0cards from\u00a0the ends, then\u00a0you\u2019re effectively\u00a0choosing some\u00a0from the\u00a0left prefix<\/strong>\u00a0and the rest\u00a0from the\u00a0right suffix<\/strong>, and you can\u00a0try all splits\u00a0in\u00a0O(k)<\/strong>\u00a0after\u00a0a couple of passes.<\/p>\n\n\n\n

Here’s the [Problem Link<\/span><\/mark><\/a><\/strong>] to begin with.<\/p>\n\n\n\n

\n\n\n\n

There are several cards arranged in a row<\/strong>, and each card has an associated number of points. The points are given in the integer array cardPoints<\/code>.<\/p>\n\n\n\n

In one step, you can take one card from the beginning or from the end of the row. You have to take exactly k<\/code> cards.<\/p>\n\n\n\n

Your score is the sum of the points of the cards you have taken.<\/p>\n\n\n\n

Given the integer array cardPoints<\/code> and the integer k<\/code>, return the maximum score<\/em> you can obtain.<\/p>\n\n\n\n

Example 1:<\/strong><\/p>\n\n\n\n

Input:<\/strong> cardPoints = [1,2,3,4,5,6,1], k = 3
Output:<\/strong> 12
Explanation:<\/strong> After the first step, your score will always be 1. However, choosing the rightmost card first will maximize your total score. The optimal strategy is to take the three cards on the right, giving a final score of 1 + 6 + 5 = 12.<\/pre>\n\n\n\n
Example 2:<\/strong><\/p>\n\n\n\n
Input:<\/strong> cardPoints = [2,2,2], k = 2
Output:<\/strong> 4
Explanation:<\/strong> Regardless of which two cards you take, your score will always be 4.<\/pre>\n\n\n\n
Example 3:<\/strong><\/p>\n\n\n\n
Input:<\/strong> cardPoints = [9,7,7,9,7,7,9], k = 7
Output:<\/strong> 55
Explanation:<\/strong> You have to take all the cards. Your score is the sum of points of all cards.<\/pre>\n\n\n\n
Constraints:<\/strong><\/p>\n\n\n\n