Add solution #1176

JoshCrozier · JoshCrozier · commit 57cb06417eb0 · 2025-06-28T00:13:29.000-05:00
diff --git a/README.md b/README.md
@@ -1099,6 +1099,7 @@
 1171|[Remove Zero Sum Consecutive Nodes from Linked List](./solutions/1171-remove-zero-sum-consecutive-nodes-from-linked-list.js)|Medium|
 1172|[Dinner Plate Stacks](./solutions/1172-dinner-plate-stacks.js)|Hard|
 1175|[Prime Arrangements](./solutions/1175-prime-arrangements.js)|Easy|
+1176|[Diet Plan Performance](./solutions/1176-diet-plan-performance.js)|Easy|
 1177|[Can Make Palindrome from Substring](./solutions/1177-can-make-palindrome-from-substring.js)|Medium|
 1178|[Number of Valid Words for Each Puzzle](./solutions/1178-number-of-valid-words-for-each-puzzle.js)|Hard|
 1184|[Distance Between Bus Stops](./solutions/1184-distance-between-bus-stops.js)|Easy|
diff --git a/solutions/1176-diet-plan-performance.js b/solutions/1176-diet-plan-performance.js
@@ -0,0 +1,48 @@
+/**
+ * 1176. Diet Plan Performance
+ * https://leetcode.com/problems/diet-plan-performance/
+ * Difficulty: Easy
+ *
+ * A dieter consumes calories[i] calories on the i-th day.
+ *
+ * Given an integer k, for every consecutive sequence of k days
+ * (calories[i], calories[i+1], ..., calories[i+k-1] for all 0 <= i <= n-k),
+ * they look at T, the total calories consumed during that sequence of k days
+ * (calories[i] + calories[i+1] + ... + calories[i+k-1]):
+ * - If T < lower, they performed poorly on their diet and lose 1 point;
+ * - If T > upper, they performed well on their diet and gain 1 point;
+ * - Otherwise, they performed normally and there is no change in points.
+ *
+ * Initially, the dieter has zero points. Return the total number of points the dieter
+ * has after dieting for calories.length days.
+ *
+ * Note that the total points can be negative.
+ */
+
+/**
+ * @param {number[]} calories
+ * @param {number} k
+ * @param {number} lower
+ * @param {number} upper
+ * @return {number}
+ */
+var dietPlanPerformance = function(calories, k, lower, upper) {
+  let windowSum = 0;
+  let points = 0;
+
+  for (let i = 0; i < k; i++) {
+    windowSum += calories[i];
+  }
+
+  if (windowSum < lower) points--;
+  else if (windowSum > upper) points++;
+
+  for (let i = k; i < calories.length; i++) {
+    windowSum = windowSum - calories[i - k] + calories[i];
+
+    if (windowSum < lower) points--;
+    else if (windowSum > upper) points++;
+  }
+
+  return points;
+};
