Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Ads Performance
Coding
- Apply bitwise tricks for performance
Coding · Bit Manipulation
- Class Performance
Coding
- Implement KV store and plan type conversions
Coding · Data Structure Design · Graphs
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1176. Diet Plan Performance
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source