Solution: Diet Plan Performance
Understand how to apply the sliding window pattern to calculate total calories over k consecutive days and assess diet performance points by updating sums efficiently. This lesson teaches you to implement this approach for optimal time and space complexity.
We'll cover the following...
We'll cover the following...
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
Tis less thanlower, the dieter ...