Given an array of integers nums, return the total number of strictly increasing subarrays.

A subarray is defined as a contiguous sequence of elements within an array. A subarray is strictly increasing if each element is strictly greater than the element immediately preceding it. Any subarray consisting of a single element of length $1$ is strictly increasing.

Constraints:

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

• $1 \leq$ nums[i] $\leq 10^6$

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.