You are given an integer array cardPoints, where each element represents the points on a card in a row. You must take exactly k cards. On each move, you may take one card from either the beginning or the end of cardPoints.

Return the maximum total points you can obtain after taking exactly k cards.

Constraints:

• $1 \leq$ cardPoints.length $\leq 10^5$

• $1 \leq$ cardPoints[i] $\leq 10^4$

• $1 \leq$ k $\leq$ cardPoints.length

Input: cardPoints = [1,2,3,4,5,6,1]-List[int], k = 3-int
Output: 12-int
Explanation: Taking 1 from the end, then 6 from the end, then 5 from the end gives 1 + 6 + 5 = 12, the maximum possible.

Input: cardPoints = [2,2,2]-List[int], k = 2-int
Output: 4-int
Explanation: You must take exactly 2 cards, and any choice of two end cards sums to 2 + 2 = 4.

Input: cardPoints = [9,7,7,9,7,7,9]-List[int], k = 7-int
Output: 55-int
Explanation: Since k equals the array length, you take all cards, for a total of 9+7+7+9+7+7+9 = 55.

Input: cardPoints = [100,40,17,9,73,75]-List[int], k = 3-int
Output: 248-int
Explanation: The best choice is to take 100 (start) and 75, 73 (the last two), for 100 + 75 + 73 = 248.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.