Given an integer array nums, find the maximum integer k such that there exist two adjacent subarrays of length k that are both strictly increasing.

Specifically, determine the maximum value of k for which there exists an index i such that both subarrays nums[i ... i + k - 1] and nums[i + k ... i + 2 * k - 1] are strictly increasing.

Return the maximum possible value of k.

Constraints:

• $2 \leq$ nums.length $\leq 2 imes 10^5$

• $-10^9 \leq$ nums[i] $\leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.