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

A subarray is called special if the bitwise OR of all its elements evaluates to at least k.

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

Constraints:

• $1 \leq$ nums.length $\leq 2 imes 10^5$

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

• $0 \leq$ k $\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.