Leetcode 3095. Shortest Subarray With OR at Least K I

Find the length of the shortest non-empty contiguous subarray whose bitwise OR of all elements is at least k, or return -1 if no such subarray exists. Input size is small (n ≤ 50, nums[i] and k < 64).

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 3095. Shortest Subarray With OR at Least K I

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact