Leetcode 3349. Adjacent Increasing Subarrays Detection I

Determine whether there exists an index a such that both contiguous subarrays nums[a..a+k-1] and nums[a+k..a+2k-1] (i.e., two adjacent length-k blocks) are strictly increasing. Return true if any such adjacent pair exists, otherwise false.