Create Adjacent Increasing Subarrays Detection I.java

varunu28 · web-flow · commit 5eaf0134b8d8 · 2024-11-17T06:52:36.000-08:00
diff --git a/Easy/Adjacent Increasing Subarrays Detection I.java b/Easy/Adjacent Increasing Subarrays Detection I.java
@@ -0,0 +1,20 @@
+class Solution {
+    public boolean hasIncreasingSubarrays(List<Integer> nums, int k) {
+        int n = nums.size();
+        for (int i = 0; i <= n - 2 * k; i++) {
+            if (isStrictlyIncreasing(nums, i, k) && isStrictlyIncreasing(nums, i + k, k)) {
+                return true;
+            }
+        }
+        return false;
+    }
+
+    private boolean isStrictlyIncreasing(List<Integer> nums, int idx, int k) {
+        for (int start = idx; start < idx + k - 1; start++) {
+            if (nums.get(start) >= nums.get(start + 1)) {
+                return false;
+            }
+        }
+        return true;
+    }
+}
