Given an integer array nums, return the length of the longest continuous strictly increasing subsequence.

A continuous strictly increasing subsequence is defined by a contiguous range of indices from $l$ to $r$ inclusive, where $l \leq r$, such that nums[i] < nums[i + 1] for all $l \leq i < r$. The length of this subsequence is $r - l + 1$.

Constraints:

• $1 \leq$ nums.length $\leq 10^4$

• $-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.