René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/longest-nice-subarray","name":"#2401 - Longest Nice Subarray - LeetCode JavaScript Solutions","description":"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 th...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {number[]} nums\n * @return {number}\n */\nvar longestNiceSubarray = function(nums) {\n  let result = 1;\n  let left = 0;\n  let usedBits = 0;\n\n  for (let right = 0; right < nums.length; right++) {\n    while ((usedBits & nums[right]) !== 0) {\n      usedBits ^= nums[left];\n      left++;\n    }\n    usedBits |= nums[right];\n    result = Math.max(result, right - left + 1);\n  }\n\n  return result;\n};","keywords":"LeetCode 2401, #2401 - Longest Nice Subarray, Medium, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}