Adjacent Increasing Subarrays Detection II
Given an array nums of n integers, your task is to find the maximum value of k for which there exist two adjacent subarrays of length k each, such that both subarrays are strictly...
Given an array nums of n integers, your task is to find the maximum value of k for which there exist two adjacent subarrays of length k each, such that both subarrays are strictly increasing. Specifically, check if there are two subarrays of length k starting at indices a and b (a < b), where:
Return the maximum possible value of k.
A subarray is a contiguous non-empty sequence of elements within an array.
Example 1
Input: nums = [2,5,7,8,9,2,3,4,3,1]
Output: 3
Example 2
Input: nums = [1,2,3,4,4,4,4,5,6,7]
Output: 2
Constraints
- 2 <= nums.length <= 2 * 10^5
- -10^9 <= nums[i] <= 10^9
Hints
Companies
No companies reported yet.
Discussion
Sign in to join the discussion.
Loading discussion...
Test results
No test cases yet.