Given a string licensePlate and an array of strings words, find the shortest completing word in words.

A completing word is a word that contains all the letters in licensePlate, ignoring case. Characters in licensePlate that are not letters (such as digits and spaces) are ignored. If a letter appears multiple times in licensePlate, it must occur at least that many times in the completing word.

Return the shortest completing word. If there are multiple shortest completing words with the same minimum length, return the first one that appears in words.

Constraints:

• $1 \leq$ licensePlate.length $\leq 7$

• licensePlate contains digits, letters (uppercase or lowercase), or space ' '.

• $1 \leq$ words.length $\leq 1000$

• $1 \leq$ words[i].length $\leq 15$

• words[i] consists 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.