You are given an array of strings words indexed starting from $0$.

Two strings are considered similar if they consist of the exact same set of characters.

Return the total number of pairs $(i, j)$ such that $0 \leq i < j <$ words.length, where words[i] and words[j] are similar.

Constraints:

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

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

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