Given a string s composed only of digits, determine whether s can be partitioned into at least $2$ non empty substrings such that the numeric value of each substring is strictly $1$ less than the numeric value of the substring immediately preceding it.

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

Constraints:

• $1 \leq$ s.length $\leq 20$

• s consists only of digits.

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.