Given an array of integers nums and an integer k, determine whether there exist $2$ adjacent subarrays of length k that are both strictly increasing.

Specifically, check if there is an index i such that both the subarray nums[i … i + k - 1] and the subarray nums[i + k … i + 2 * k - 1] are strictly increasing.

Return true if such adjacent subarrays exist, and false otherwise.

Constraints:

• $2 \leq$ nums.length $\leq 100$

• $1 < 2 imes$ k $\leq$ nums.length

• $-1000 \leq$ nums[i] $\leq 1000$

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.