Given an array of strings words, return an array containing every character that appears in each string in words, including duplicates. If a character occurs multiple times in all strings, include it in the result that many times. The returned characters may be in any order.

Constraints:

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

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

• 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.