DSA using JavaScript

Sliding Window

function shortestSubarrayWithORAtLeastKBruteForce(nums, k) {
    let minLength = Infinity;

    for (let i = 0; i < nums.length; i++) {
        let orValue = 0;
        for (let j = i; j < nums.length; j++) {
            orValue |= nums[j];
            if (orValue >= k) {
                minLength = Math.min(minLength, j - i + 1);
                break; // no need to continue if OR is already >= k
            }
        }
    }

    return minLength === Infinity ? -1 : minLength;
}

const nums = [1, 2, 3];
const k = 2;
console.log(shortestSubarrayWithORAtLeastKBruteForce(nums, k));  // Output: 1

function shortestSubarrayWithORAtLeastKEfficient(nums, k) {
    let left = 0;
    let minLength = Infinity;
    let orValue = 0;

    for (let right = 0; right < nums.length; right++) {
        orValue |= nums[right];

        while (orValue >= k) {
            minLength = Math.min(minLength, right - left + 1);
            orValue ^= nums[left];  // Remove nums[left] from OR calculation
            left++;
        }
    }

    return minLength === Infinity ? -1 : minLength;
}

const nums = [2, 1, 8];
const k = 10;
console.log(shortestSubarrayWithORAtLeastKEfficient(nums, k));  // Output: 3