Simple Solution
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\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 maximumNumberOfStringPairs = function(words) {\n\n    const reverseArr = words.map(x => x.split(\'\').reverse().join(\'\'))\n     let count = 0\n\n     reverseArr.forEach((x , index)=>{\n       for(let i=index+1; i<words.length; i++){\n           if(x === words[i]){\n               count ++\n           }\n       }\n    })\n    \n    return count  \n\n};\n```
['JavaScript']