Given an integer array nums sorted in non decreasing order, determine if it is possible to partition nums into one or more subsequences such that:

• Each subsequence is composed of consecutive increasing integers where each value is exactly $1$ greater than the preceding value.

• Every subsequence has a length of at least $3$.

Return true if such a partition is possible, or false otherwise.

Constraints:

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

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

• nums is sorted in non decreasing order.

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.