You are given an array of non negative integers nums and an integer k.

An array is considered special if the bitwise OR of all its elements evaluates to at least k.

Return the length of the shortest non empty special subarray of nums, or $-1$ if no such subarray exists.

Constraints:

• $1 \leq$ nums.length $\leq 50$

• $0 \leq$ nums[i] $\leq 50$

• $0 \leq$ k $< 64$

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.