Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
- Shortest Subarray With OR at Least K II
Coding
- Shortest Subarray with Sum at Least K
Coding · Array · Binary Search · Heap (Priority Queue)
- Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Walk through Kadane's algorithm and explain the O(n) approach.
Coding
- Shortest Subarray to be Removed to Make Array Sorted
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3095. Shortest Subarray With OR at Least K I
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source