Solution

Method 1 – Binary Search with Sliding Window

Intuition

We want the largest k such that there exist two adjacent subarrays of length k that are both strictly increasing. Since checking for all possible k is inefficient, we can use binary search on k and efficiently check for each k using a sliding window.

Approach

Binary Search on k:

Set lo = 1, hi = n // 2 (since two adjacent subarrays of length k need 2k <= n).
For each k, check if there exist two adjacent strictly increasing subarrays of length k.

Related Tags

Continue Practicing