Create Shortest Subarray With OR at Least K I.java

varunu28 · web-flow · commit 8688def7aadb · 2024-03-31T07:33:58.000-07:00
diff --git a/Easy/Shortest Subarray With OR at Least K I.java b/Easy/Shortest Subarray With OR at Least K I.java
@@ -0,0 +1,17 @@
+class Solution {
+    public int minimumSubarrayLength(int[] nums, int k) {
+        int n = nums.length;
+        int result = Integer.MAX_VALUE;
+        for (int i = 0; i < n; i++) {
+            int curr = 0;
+            for (int j = i; j < n; j++) {
+                curr |= nums[j];
+                if (curr >= k) {
+                    result = Math.min(result, j - i + 1);
+                    break;
+                }
+            }
+        }
+        return result == Integer.MAX_VALUE ? -1 : result;
+    }
+}
