Leetcode Problem 1423. Maximum Points You Can Obtain from Cards

1423. Maximum Points You Can Obtain from Cards

Leetcode Solutions

Sliding Window Approach

  1. Calculate the total sum of the cardPoints array and store it in totalScore.
  2. If k is equal to the length of cardPoints, return totalScore as all cards are taken.
  3. Initialize minSubarrayScore to totalScore.
  4. Initialize presentSubarrayScore to the sum of the first cardPoints.length - k elements.
  5. Iterate over the array starting from index cardPoints.length - k to the end of the array.
  6. Update presentSubarrayScore by adding the current element and subtracting the element at the start of the current window.
  7. Update minSubarrayScore if presentSubarrayScore is less than the current minSubarrayScore.
  8. After the loop, subtract minSubarrayScore from totalScore to get the maximum score that can be obtained.
  9. Return the maximum score.
UML Thumbnail

Prefix and Suffix Sums Approach

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...