Leetcode Problem 1176. Diet Plan Performance

1176. Diet Plan Performance

Leetcode Solutions

Sliding Window Approach

Initialize points to 0 to store the total points.
Initialize windowSum to 0 to store the sum of calories in the current window.
Iterate through the calories array with an index i.
- Add calories[i] to windowSum.
- If i is greater than or equal to k - 1, we have a complete window.
  - If i is greater than k - 1, subtract calories[i - k] from windowSum to remove the element that is no longer in the window.
  - If windowSum is less than lower, decrement points.
  - If windowSum is greater than upper, increment points.
Return points as the final result.

Ask Question

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen

Loading...

Suggested Answer

Answer

Full Screen

Copy Answer Code

Loading...