Search⌘ K
AI Features

Solution: Diet Plan Performance

Explore how to use the sliding window technique to solve the Diet Plan Performance problem. Learn to maintain a running sum of calorie intake over k days to efficiently evaluate and update diet performance points based on given thresholds.

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 ...