You are given an array of strings words.

In one operation, you can choose two distinct indices i and j, remove any character from words[i], and insert it at any position in words[j].

Return true if it is possible to make every string in words equal after applying any number of operations, or false otherwise.

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.