CodeDominar Solution
Code\n\n@1st approach \n\nclass Solution:\n    def similarPairs(self, words: List[str]) -> int:\n        d=Counter()\n        count=0\n        for current_word 
# Code\n```\n@1st approach \n\nclass Solution:\n    def similarPairs(self, words: List[str]) -> int:\n        d=Counter()\n        count=0\n        for current_word in words:\n            word="".join(sorted(set(current_word)))\n            count+=d[word]\n            d[word]+=1\n        return count   \n#####################################\n@2nd approach\n\nclass Solution:\n    def similarPairs(self, words: List[str]) -> int:\n        return sum(set(words[i])==set(words[j]) for i in range(len(words)) for j in range(i+1,len(words)))\n\n\n```
['Python3']