Add solution #2401

Author: JoshCrozier

README.md

@@ -849,6 +849,7 @@
 2381|[Shifting Letters II](./2381-shifting-letters-ii.js)|Medium|
 2390|[Removing Stars From a String](./2390-removing-stars-from-a-string.js)|Medium|
 2396|[Strictly Palindromic Number](./2396-strictly-palindromic-number.js)|Medium|
+2401|[Longest Nice Subarray](./2401-longest-nice-subarray.js)|Medium|
 2413|[Smallest Even Multiple](./2413-smallest-even-multiple.js)|Easy|
 2425|[Bitwise XOR of All Pairings](./2425-bitwise-xor-of-all-pairings.js)|Medium|
 2427|[Number of Common Factors](./2427-number-of-common-factors.js)|Easy|

solutions/2401-longest-nice-subarray.js

@@ -0,0 +1,37 @@
+/**
+ * 2401. Longest Nice Subarray
+ * https://leetcode.com/problems/longest-nice-subarray/
+ * Difficulty: Medium
+ *
+ * You are given an array nums consisting of positive integers.
+ *
+ * We call a subarray of nums nice if the bitwise AND of every pair of elements that are in
+ * different positions in the subarray is equal to 0.
+ *
+ * Return the length of the longest nice subarray.
+ *
+ * A subarray is a contiguous part of an array.
+ *
+ * Note that subarrays of length 1 are always considered nice.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var longestNiceSubarray = function(nums) {
+  let result = 1;
+  let left = 0;
+  let usedBits = 0;
+
+  for (let right = 0; right < nums.length; right++) {
+    while ((usedBits & nums[right]) !== 0) {
+      usedBits ^= nums[left];
+      left++;
+    }
+    usedBits |= nums[right];
+    result = Math.max(result, right - left + 1);
+  }
+
+  return result;
+};