1423. Maximum Points You Can Obtain from Cards LeetCode Solution

In this guide, you will get 1423. Maximum Points You Can Obtain from Cards LeetCode Solution with the best time and space complexity. The solution to Maximum Points You Can Obtain from Cards problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.

Problem Statement
Complexity Analysis
Maximum Points You Can Obtain from Cards solution in C++
Maximum Points You Can Obtain from Cards solution in Java
Maximum Points You Can Obtain from Cards solution in Python
Additional Resources

1423. Maximum Points You Can Obtain from Cards LeetCode Solution image

Problem Statement of Maximum Points You Can Obtain from Cards

There are several cards arranged in a row, and each card has an associated number of points. The points are given in the integer array cardPoints.
In one step, you can take one card from the beginning or from the end of the row. You have to take exactly k cards.
Your score is the sum of the points of the cards you have taken.
Given the integer array cardPoints and the integer k, return the maximum score you can obtain.

Example 1:

Input: cardPoints = [1,2,3,4,5,6,1], k = 3
Output: 12
Explanation: 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.

Example 2:

Input: cardPoints = [2,2,2], k = 2
Output: 4
Explanation: Regardless of which two cards you take, your score will always be 4.

Example 3:

Input: cardPoints = [9,7,7,9,7,7,9], k = 7
Output: 55
Explanation: You have to take all the cards. Your score is the sum of points of all cards.

Constraints:

1 <= cardPoints.length <= 105
1 <= cardPoints[i] <= 104
1 <= k <= cardPoints.length

Complexity Analysis

Time Complexity: O(n)
Space Complexity: O(1)

1423. Maximum Points You Can Obtain from Cards LeetCode Solution in C++

class Solution {
 public:
  int maxScore(vector<int>& cardPoints, int k) {
    const int n = cardPoints.size();
    const int sum = accumulate(cardPoints.begin(), cardPoints.end(), 0);
    int windowSum =
        accumulate(cardPoints.begin(), cardPoints.begin() + n - k, 0);
    int ans = sum - windowSum;

    for (int i = 0; i < k; ++i) {
      windowSum -= cardPoints[i];
      windowSum += cardPoints[i + n - k];
      ans = max(ans, sum - windowSum);
    }

    return ans;
  }
};
/* code provided by PROGIEZ */

1423. Maximum Points You Can Obtain from Cards LeetCode Solution in Java

class Solution {
  public int maxScore(int[] cardPoints, int k) {
    final int n = cardPoints.length;
    final int sum = Arrays.stream(cardPoints).sum();
    int windowSum = 0;
    for (int i = 0; i < n - k; ++i)
      windowSum += cardPoints[i];

    int ans = sum - windowSum;

    for (int i = 0; i < k; ++i) {
      windowSum -= cardPoints[i];
      windowSum += cardPoints[i + n - k];
      ans = Math.max(ans, sum - windowSum);
    }

    return ans;
  }
}
// code provided by PROGIEZ

1423. Maximum Points You Can Obtain from Cards LeetCode Solution in Python

class Solution:
  def maxScore(self, cardPoints: list[int], k: int) -> int:
    n = len(cardPoints)
    summ = sum(cardPoints)
    windowSum = sum(cardPoints[:n - k])
    ans = summ - windowSum

    for i in range(k):
      windowSum -= cardPoints[i]
      windowSum += cardPoints[i + n - k]
      ans = max(ans, summ - windowSum)

    return ans
 # code by PROGIEZ