Given an integer array nums, return the number of longest strictly increasing subsequences it contains.

Constraints:

• $1 \le$ nums.length $\leq 2000$

• $-10^{6} \leq$ nums[i] $\leq 10^{6}$

• The result is guaranteed to fit in a 32-bit integer.

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.