Python Easy to Understand code || Accepted✅
Approach\nusing sets to check if two words in the array words contain same characters. \n\n# Complexity\n- Time complexity:\nsince a nested for is used, O(n^2)\
# Approach\nusing sets to check if two words in the array words contain same characters. \n\n# Complexity\n- Time complexity:\nsince a nested for is used, O(n^2)\n\n# Code\n```\nclass Solution:\n    def similarPairs(self, words: List[str]) -> int:\n        count = 0\n        for i in range(len(words)):\n            for j in range(i):\n            #checking if 2 words has characters and then incrementing count\n                if set(words[i]) == set(words[j]):\n                    count += 1\n        return count\n```
['Python3']