Shortest Subarray OR ≥ K

You are given an array nums of non-negative integers and an integer k. Return the length of the shortest non-empty subarray whose bitwise OR is at least k. If no such subarray exists, return -1. This version requires an O(n) sliding window using bit-count tracking — maintain a 32-element array tracking how many window elements have each bit set.

Examples
Input: [[1,2,3],4]
Output: -1
Hints

Shortest Subarray OR ≥ K

You are given an array nums of non-negative integers and an integer k. Return the length of the shortest non-empty subarray whose bitwise OR is at least k. If no such subarray exists, return -1. This version requires an O(n) sliding window using bit-count tracking — maintain a 32-element array tracking how many window elements have each bit set.