Adjacent Increasing Subarrays Detection I - Practice Coding | SlaveCode
0
0123456789
0
0123456789
:
0
0123456789
0
0123456789
3349. Adjacent Increasing Subarrays Detection I
Easy
10 Points
Array
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:
Return true if it is possible to find two such subarrays, and false otherwise.
Examples
Example 1
Input: nums = [2,5,7,8,9,2,3,4,3,1], k = 3
Output: true
Explanation:
Example 2
Input: nums = [1,2,3,4,4,4,4,5,6,7], k = 5
Output: false
Constraints
2 <= nums.length <= 100
1 < 2 * k <= nums.length
-1000 <= nums[i] <= 1000
3349. Adjacent Increasing Subarrays Detection I
Easy
10 Points
Array
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:
Return true if it is possible to find two such subarrays, and false otherwise.
Examples
Example 1
Input: nums = [2,5,7,8,9,2,3,4,3,1], k = 3
Output: true
Explanation:
Example 2
Input: nums = [1,2,3,4,4,4,4,5,6,7], k = 5
Output: false