Given an integer array nums of length n.

For each index i from $0$ to n $- 1$, consider all possible subarrays starting at index i. Among all these subarrays, determine the minimum length of a subarray whose bitwise OR is equal to the maximum bitwise OR achievable by any subarray starting at i.

Return an integer array answer of length n, where answer[i] is the minimum length of such a subarray starting at index i.

Constraints:

• n == nums.length

• $1 \leq$ n $\leq 10^5$

• $0 \leq$ nums[i] $\leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.