Add solution #795

Author: JoshCrozier

README.md

@@ -605,6 +605,7 @@
 792|[Number of Matching Subsequences](./0792-number-of-matching-subsequences.js)|Medium|
 793|[Preimage Size of Factorial Zeroes Function](./0793-preimage-size-of-factorial-zeroes-function.js)|Hard|
 794|[Valid Tic-Tac-Toe State](./0794-valid-tic-tac-toe-state.js)|Medium|
+795|[Number of Subarrays with Bounded Maximum](./0795-number-of-subarrays-with-bounded-maximum.js)|Medium|
 796|[Rotate String](./0796-rotate-string.js)|Easy|
 802|[Find Eventual Safe States](./0802-find-eventual-safe-states.js)|Medium|
 804|[Unique Morse Code Words](./0804-unique-morse-code-words.js)|Easy|

solutions/0795-number-of-subarrays-with-bounded-maximum.js

@@ -0,0 +1,36 @@
+/**
+ * 795. Number of Subarrays with Bounded Maximum
+ * https://leetcode.com/problems/number-of-subarrays-with-bounded-maximum/
+ * Difficulty: Medium
+ *
+ * Given an integer array nums and two integers left and right, return the number of contiguous
+ * non-empty subarrays such that the value of the maximum array element in that subarray is in
+ * the range [left, right].
+ *
+ * The test cases are generated so that the answer will fit in a 32-bit integer.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number} left
+ * @param {number} right
+ * @return {number}
+ */
+var numSubarrayBoundedMax = function(nums, left, right) {
+  let result = 0;
+  let validCount = 0;
+  let prevInvalidGreater = -1;
+
+  for (let i = 0; i < nums.length; i++) {
+    if (nums[i] > right) {
+      validCount = 0;
+      prevInvalidGreater = i;
+    } else if (nums[i] >= left) {
+      validCount = i - prevInvalidGreater;
+    }
+
+    result += validCount;
+  }
+
+  return result;
+};