Given a positive integer n, split it into its non-zero base-$10$ place-value components and return them in descending order.

A base-$10$ component is a number of the form $d imes 10^k$, where $1 \leq d \leq 9$ and $k \geq 0$. The sum of all returned components must equal n.

Constraints:

• $1 \leq$ n $\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.