Given two integers n and s, determine the largest nonnegative integer with at most n digits such that the sum of its digits is equal to s. If no such integer exists, return $-1$.

Constraints:

• $1 \leq$ n $\leq 5$

• $0 \leq$ s $\leq 100$

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.