Add solution #2302

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,505 LeetCode solutions in JavaScript
+# 1,506 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1395,6 +1395,7 @@
 2244|[Minimum Rounds to Complete All Tasks](./solutions/2244-minimum-rounds-to-complete-all-tasks.js)|Medium|
 2270|[Number of Ways to Split Array](./solutions/2270-number-of-ways-to-split-array.js)|Medium|
 2300|[Successful Pairs of Spells and Potions](./solutions/2300-successful-pairs-of-spells-and-potions.js)|Medium|
+2302|[Count Subarrays With Score Less Than K](./solutions/2302-count-subarrays-with-score-less-than-k.js)|Hard|
 2336|[Smallest Number in Infinite Set](./solutions/2336-smallest-number-in-infinite-set.js)|Medium|
 2338|[Count the Number of Ideal Arrays](./solutions/2338-count-the-number-of-ideal-arrays.js)|Hard|
 2342|[Max Sum of a Pair With Equal Sum of Digits](./solutions/2342-max-sum-of-a-pair-with-equal-sum-of-digits.js)|Medium|

solutions/2302-count-subarrays-with-score-less-than-k.js

@@ -0,0 +1,35 @@
+/**
+ * 2302. Count Subarrays With Score Less Than K
+ * https://leetcode.com/problems/count-subarrays-with-score-less-than-k/
+ * Difficulty: Hard
+ *
+ * The score of an array is defined as the product of its sum and its length.
+ * - For example, the score of [1, 2, 3, 4, 5] is (1 + 2 + 3 + 4 + 5) * 5 = 75.
+ *
+ * Given a positive integer array nums and an integer k, return the number of non-empty subarrays
+ * of nums whose score is strictly less than k.
+ *
+ * A subarray is a contiguous sequence of elements within an array.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number}
+ */
+var countSubarrays = function(nums, k) {
+  let result = 0;
+  let currentSum = 0;
+  let left = 0;
+
+  for (let right = 0; right < nums.length; right++) {
+    currentSum += nums[right];
+    while (currentSum * (right - left + 1) >= k) {
+      currentSum -= nums[left];
+      left++;
+    }
+    result += right - left + 1;
+  }
+
+  return result;
+};