Javascript simple solution
Intuition\nusing builtin array and string methods to make the solution more easily understand\n\n# Approach\nin one line make every word in array to unique, sor
# Intuition\nusing builtin array and string methods to make the solution more easily understand\n\n# Approach\nin one line make every word in array to unique, sorted\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\n/**\n * @param {string[]} words\n * @return {number}\n */\nvar similarPairs = function(words) {\n\n   const str = words.map(word => [...new Set(word)].sort().join(\'\'));\n    let count = 0;\n    \n    for(let i=0; i<str.length; i++){\n        for(let j=i+1; j<str.length; j++){\n            if(str[i] == str[j]){\n                count++\n            }\n        }\n    }\n    return count;\n};\n```
['JavaScript']