Smallest Subarrays With Maximum Bitwise OR

For each index i, find the smallest subarray starting at i whose bitwise OR equals the maximum OR achievable from i to the end. The challenge is to avoid O(n^2) brute force by exploiting bitwise properties (tracking next/last occurrences of set bits) to compute each answer efficiently.