Time: 1 ms (100.00%), Space: 43.7 MB (99.74%) - LeetHub

py3-coder · py3-coder · commit 1d6114c75c4b · 2024-12-05T23:05:23.000+05:30
diff --git a/3349-adjacent-increasing-subarrays-detection-i/3349-adjacent-increasing-subarrays-detection-i.java b/3349-adjacent-increasing-subarrays-detection-i/3349-adjacent-increasing-subarrays-detection-i.java
@@ -0,0 +1,27 @@
+class Solution {
+    public boolean hasIncreasingSubarrays(List<Integer> nums, int k) {
+        
+        int n = nums.size();
+        if(n<2*k) return false;
+        if(k==1) return true;
+        for(int i=0;i<n-2*k+1;i++){
+           if(check(i,k,nums)==true){
+               return true;
+           }
+        }
+        return false;
+    }
+    public boolean check(int i , int k , List<Integer> nums){
+        int n = nums.size();
+        for(int j=i;j<i+2*k-1 && j<n-1 ;j++){
+                int curr = nums.get(j) , next = nums.get(j+1);
+                if(curr >=next && j!=i+k-1){
+                    return false;
+                }
+                if(j == i+k-1){
+                    continue;
+                }
+            }
+        return true;
+    }
+}
