Leetcode 1176. Diet Plan Performance

Given an array of daily calories and integers k, lower, and upper, compute the total score by evaluating the sum of every consecutive k-day window: decrement the score if the window sum < lower, increment if > upper, otherwise leave it unchanged. Use a sliding-window approach to efficiently compute each k-day sum and return the final score.