Easy to Understand || Solution by Navyendhu Menon
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    let count =0\n\n    for ( let i=0 ; i<words.length; i++){\n        for(let k=i+1 ; k< words.length ; k++){\n            if(words[i].split("").reverse().join("")== words[k]){\n                count++\n            }\n        }\n    }\n\n    return count\n    \n};\n```
['JavaScript']