Maximum Points You Can Obtain from Cards

lcpy gen -n 1423   # by problem number
lcpy gen -s maximum_points_you_can_obtain_from_cards   # by problem name

Input: cardPoints = [1,2,3,4,5,6,1], k = 3
Output: 12

Input: cardPoints = [2,2,2], k = 2
Output: 4

Input: cardPoints = [9,7,7,9,7,7,9], k = 7
Output: 55

class Solution:
    # Time: O(k)
    # Space: O(1)
    def max_score(self, card_points: list[int], k: int) -> int:
        window = sum(card_points[:k])
        best = window
        for i in range(1, k + 1):
            window += card_points[-i] - card_points[k - i]
            best = max(best, window)
        return best