easy one xd
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)$$ -->\nO(N)\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\nO(1)\n# Code\n```\nfunc maximumNumberOfStringPairs(words []string) int {\n\tst := make(map[string]bool)\n\tres := 0\n\tfor _, i := range words {\n\t\ts := i\n\t\ti = reverseString(i)\n\t\tif !st[i] {\n\t\t\tst[s] = true\n\t\t} else {\n\t\t\tres++\n\t\t}\n\t}\n\treturn res\n}\n\nfunc reverseString(s string) string {\n\trunes := []rune(s)\n\tfor i, j := 0, len(runes)-1; i < j; i, j = i+1, j-1 {\n\t\trunes[i], runes[j] = runes[j], runes[i]\n\t}\n\treturn string(runes)\n}\n```
['Go']