Search⌘ K
AI Features

Solution: Diet Plan Performance

Understand how to apply the sliding window technique to track performance over sequences of consecutive days based on calorie intake. Learn to calculate sums efficiently and update performance points accordingly for a clear solution to the diet plan performance problem.

Statement

A dieter consumes calories[i] calories on the i-th day.

Given an integer k, the dieter reviews their calorie intake over every sequence of k consecutive days (from calories[i] to calories[i+k-1] for all 0 <= i <= n-k). For each sequence, they calculate T, the total calories consumed over those k days:

  • If T is less than lower, the dieter ...