Shortest Subarray With OR at Least K II

lcpy gen -n 3097   # by problem number
lcpy gen -s shortest_subarray_with_or_at_least_k_ii   # by problem name

Input: nums = [1,2,3], k = 2
Output: 1
Explanation:
The subarray [3] has OR value of 3. Hence, we return 1.

Input: nums = [2,1,8], k = 10
Output: 3
Explanation:
The subarray [2,1,8] has OR value of 11. Hence, we return 3.

Input: nums = [1,2], k = 0
Output: 1
Explanation:
The subarray [1] has OR value of 1. Hence, we return 1.

class Solution:
    # Time: O(n * 30)
    # Space: O(30)
    def minimum_subarray_length(self, nums: list[int], k: int) -> int:
        best = len(nums) + 1
        counts = [0] * 30
        left = 0
        for right, value in enumerate(nums):
            for bit in range(30):
                if (value >> bit) & 1:
                    counts[bit] += 1
            while left <= right and self._or_value(counts) >= k:
                best = min(best, right - left + 1)
                for bit in range(30):
                    if (nums[left] >> bit) & 1:
                        counts[bit] -= 1
                left += 1
        return -1 if best == len(nums) + 1 else best

    def _or_value(self, counts: list[int]) -> int:
        value = 0
        for bit, count in enumerate(counts):
            if count:
                value |= 1 << bit
        return value