Easy Approach
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```\nclass Solution {\n    public int maximumNumberOfStringPairs(String[] words)\n\t\t{\n\t\t\tint count=0;\n\t\t\tint n=words.length;\n\t\t\tfor(int i = 0; i < n; i++)\n\t\t\t{\n          for(int j = i + 1; j < n; j++)\n\t\t\t\t\t{\n            if(words[i].charAt(0) == words[j].charAt(1) && words[i].charAt(1) == words[j].charAt(0))\n\t\t\t\t\t\t{\n              count++;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t}\n\t\t\treturn count;\n\t\t}\n}\n```
['Java']