Add solution #3349

Author: JoshCrozier

README.md

@@ -2712,6 +2712,7 @@
 3342|[Find Minimum Time to Reach Last Room II](./solutions/3342-find-minimum-time-to-reach-last-room-ii.js)|Medium|
 3343|[Count Number of Balanced Permutations](./solutions/3343-count-number-of-balanced-permutations.js)|Hard|
 3344|[Maximum Sized Array](./solutions/3344-maximum-sized-array.js)|Medium|
+3349|[Adjacent Increasing Subarrays Detection I](./solutions/3349-adjacent-increasing-subarrays-detection-i.js)|Easy|
 3353|[Minimum Total Operations](./solutions/3353-minimum-total-operations.js)|Easy|
 3355|[Zero Array Transformation I](./solutions/3355-zero-array-transformation-i.js)|Medium|
 3356|[Zero Array Transformation II](./solutions/3356-zero-array-transformation-ii.js)|Medium|

solutions/3349-adjacent-increasing-subarrays-detection-i.js

@@ -0,0 +1,36 @@
+/**
+ * 3349. Adjacent Increasing Subarrays Detection I
+ * https://leetcode.com/problems/adjacent-increasing-subarrays-detection-i/
+ * Difficulty: Easy
+ *
+ * Given an array nums of n integers and an integer k, determine whether there exist two
+ * adjacent subarrays of length k such that both subarrays are strictly increasing.
+ * Specifically, check if there are two subarrays starting at indices a and b (a < b),
+ * where:
+ * - Both subarrays nums[a..a + k - 1] and nums[b..b + k - 1] are strictly increasing.
+ * - The subarrays must be adjacent, meaning b = a + k.
+ *
+ * Return true if it is possible to find two such subarrays, and false otherwise.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {boolean}
+ */
+var hasIncreasingSubarrays = function(nums, k) {
+  for (let i = 0; i <= nums.length - 2 * k; i++) {
+    if (helper(i, k) && helper(i + k, k)) {
+      return true;
+    }
+  }
+
+  return false;
+
+  function helper(start, length) {
+    for (let i = start; i < start + length - 1; i++) {
+      if (nums[i] >= nums[i + 1]) return false;
+    }
+    return true;
+  }
+};