Leetcode 3350. Adjacent Increasing Subarrays Detection II

Find the largest integer k such that the array contains two adjacent length-k contiguous subarrays (one immediately following the other) that are both strictly increasing. With n up to 2·10^5, this is solved by leveraging lengths of maximal increasing runs (or binary-search over k with linear feasibility checks) rather than brute force.