Count Similar String pairs

We have a string array of words. Two strings are considered similar if they consist of the same characters.

For example, "abca" and "cba" are considered similar since both consist of characters 'a', 'b', and 'c'. However, "abacba" and "bcfd" are not similar because they do not consist of the same characters. Return the number of pairs (i, j) such that 0 <= i< j <= word.length – 1 when the two strings words[i] and words[j] are similar.

Example 1:

Input: words = ["aba", "aabb", "abcd", "bac", "aabc"]

Output: 2

Explanation: There are 2 pairs that satisfy the conditions:– i = 0 and j = 1 : both words[0] and words[1] only consist of characters 'a' and 'b'.– i = 3 and j = 4 : both words[3] and words[4] only consist of characters 'a', 'b', and 'c'.

Example 2:

Input: words = ["aabb", "ab", "ba"]

Output: 3


Can anyone help me without above problem statement?