You are given strings s and target. You can select characters from s and rearrange them to construct copies of target.

Return the maximum number of copies of target that can be formed when each character in s is used at most $1$ time.

Constraints:

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

• $1 \leq$ target.length $\leq 10$

• s and target consist of lowercase English letters.

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.