Add solution #1438

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,302 LeetCode solutions in JavaScript
+# 1,303 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1097,6 +1097,7 @@
 1434|[Number of Ways to Wear Different Hats to Each Other](./solutions/1434-number-of-ways-to-wear-different-hats-to-each-other.js)|Hard|
 1436|[Destination City](./solutions/1436-destination-city.js)|Easy|
 1437|[Check If All 1's Are at Least Length K Places Away](./solutions/1437-check-if-all-1s-are-at-least-length-k-places-away.js)|Easy|
+1438|[Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit](./solutions/1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit.js)|Medium|
 1443|[Minimum Time to Collect All Apples in a Tree](./solutions/1443-minimum-time-to-collect-all-apples-in-a-tree.js)|Medium|
 1446|[Consecutive Characters](./solutions/1446-consecutive-characters.js)|Easy|
 1447|[Simplified Fractions](./solutions/1447-simplified-fractions.js)|Medium|

solutions/1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit.js

@@ -0,0 +1,45 @@
+/**
+ * 1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit
+ * https://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/
+ * Difficulty: Medium
+ *
+ * Given an array of integers nums and an integer limit, return the size of the longest non-empty
+ * subarray such that the absolute difference between any two elements of this subarray is less than
+ * or equal to limit.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number} limit
+ * @return {number}
+ */
+var longestSubarray = function(nums, limit) {
+  const maxDeque = [];
+  const minDeque = [];
+  let result = 0;
+  let left = 0;
+
+  for (let right = 0; right < nums.length; right++) {
+    while (maxDeque.length && nums[maxDeque[maxDeque.length - 1]] <= nums[right]) {
+      maxDeque.pop();
+    }
+    maxDeque.push(right);
+
+    while (minDeque.length && nums[minDeque[minDeque.length - 1]] >= nums[right]) {
+      minDeque.pop();
+    }
+    minDeque.push(right);
+
+    while (nums[maxDeque[0]] - nums[minDeque[0]] > limit) {
+      if (maxDeque[0] < minDeque[0]) {
+        left = maxDeque.shift() + 1;
+      } else {
+        left = minDeque.shift() + 1;
+      }
+    }
+
+    result = Math.max(result, right - left + 1);
+  }
+
+  return result;
+};