Add solution #713

Author: JoshCrozier

README.md

@@ -28,6 +28,7 @@
 628|[Maximum Product of Three Numbers](./0628-maximum-product-of-three-numbers.js)|Easy|
 648|[Replace Words](./0648-replace-words.js)|Medium|
 686|[Repeated String Match](./0686-repeated-string-match.js)|Easy|
+713|[Subarray Product Less Than K](./0713-subarray-product-less-than-k.js)|Medium|
 722|[Remove Comments](./0722-remove-comments.js)|Medium|
 739|[Daily Temperatures](./0739-daily-temperatures.js)|Medium|
 791|[Custom Sort String](./0791-custom-sort-string.js)|Medium|

solutions/0713-subarray-product-less-than-k.js

@@ -0,0 +1,30 @@
+/**
+ * 713. Subarray Product Less Than K
+ * https://leetcode.com/problems/subarray-product-less-than-k/
+ * Difficulty: Medium
+ *
+ * Your are given an array of positive integers nums.
+ *
+ * Count and print the number of (contiguous) subarrays where the
+ * product of all the elements in the subarray is less than k.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number}
+ */
+var numSubarrayProductLessThanK = function(nums, k) {
+  let result = 0;
+  for (let right = 0, left = 0, product = 1; right < nums.length; right++) {
+    product *= nums[right];
+    while (product >= k && left < nums.length) {
+      product /= nums[left];
+      left++;
+    }
+    if (left < nums.length) {
+      result = result + right - left + 1;
+    }
+  }
+  return result;
+};