3095. Shortest Subarray With OR at Least K I

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

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

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

G - Smaller Sum

F - Negative Traveling Salesman

F - Hop Sugoroku

A - Shuffle and mod K

F - Christmas Present 2

Sherlock holmes and The temple Mystery

Lucky String Jackpot

Roy and Sweets

Terminators