Given an integer array cost of size $9$ and an integer target, return the largest integer as a string whose total cost equals target.

The cost of choosing the digit $i$ (where $1 \leq i \leq 9$) is given by cost[i - 1]. The total cost of an integer is the sum of the costs of all its individual digits.

If no integer can be formed whose total cost equals target, return "0".

Constraints:

• cost.length $= 9$

• $1 \leq$ cost[i], target $\leq 5000$

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.