JuniorArray
Adjacent Increasing Subarrays Detection I
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]andnums[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.
Example 1
Input
nums = [2,5,7,8,9,2,3,4,3,1], k = 3Output
trueThe subarrays
[7, 8, 9] starting at index 2 and [2, 3, 4] starting at index 5 are both strictly increasing and adjacent.Example 2
Input
nums = [1,2,3,4,4,4,4,5,6,7], k = 5Output
falseThere are no two adjacent subarrays of length
5 that are both strictly increasing.Constraints
- 2 <= nums.length <= 100
- 1 < 2 * k <= nums.length
- -1000 <= nums[i] <= 1000