3350. Adjacent Increasing Subarrays Detection II

Given an array nums, find the maximum k such that there exist two adjacent subarrays of length k, each strictly increasing (the second immediately after the first).