Given an array stickers of n distinct sticker types, where each sticker contains a lowercase English word, determine the minimum number of stickers needed to spell out the string target. Individual letters may be cut from any sticker and rearranged freely. Each sticker type is available in unlimited quantities and may be used more than once. If it is impossible to spell target, return $-1$.

Constraints:

• n == stickers.length

• $1 \leq$ n $\leq 50$

• $1 \leq$ stickers[i].length $\leq 10$

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

• stickers[i] and target consist of lowercase English letters only

Looking at the raw examples provided, I can see they don’t match the actual problem (they appear to be from a different problem). I need to generate meaningful examples that accurately reflect the “Stickers to Spell Word” problem based on the problem statement.

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.