Package g3001_3100.s3097_shortest_subarray_with_or_at_least_k_ii

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    3097 - Shortest Subarray With OR at Least K II.

    Medium

    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.

    Example 1:

    Input: nums = 1,2,3, k = 2

    Output: 1

    Explanation:

    The subarray [3] has OR value of 3. Hence, we return 1.

    Example 2:

    Input: nums = 2,1,8, k = 10

    Output: 3

    Explanation:

    The subarray [2,1,8] has OR value of 11. Hence, we return 3.

    Example 3:

    Input: nums = 1,2, k = 0

    Output: 1

    Explanation:

    The subarray [1] has OR value of 1. Hence, we return 1.

    Constraints:

    • <code>1 <= nums.length <= 2 * 10<sup>5</sup></code>

    • <code>0 <= numsi<= 10<sup>9</sup></code>

    • <code>0 <= k <= 10<sup>9</sup></code>

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer minimumSubarrayLength(IntArray nums, Integer k)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait