Diet Plan Performance

Explore the sliding window technique to evaluate a dieter's performance over consecutive days by calculating points based on calorie intake. Understand how to efficiently track and update total calories over sequences to determine performance changes, and practice implementing this approach in C++.

We'll cover the following...

Statement
Examples
Understand the problem
Figure it out!
Try it yourself

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 performs poorly and loses 1 point.
If T is greater than upper, the dieter performs better and gains 1 point.
If T is between lower and upper (inclusive), the dieter’s performance is normal, and their points remain the same.

The dieter starts with zero points. Return the total points after the dieter follows this routine for all calories.length days. The total points can be negative.

Constraints