Easy c++ solution using linear search.
Intuition\n\n# Approach\nBrute Force Solution:\nUsing two loops firstly reverse the string of words and compare string of entire words.\n\n# Complexity\n- Time 
# Intuition\n\n# Approach\nBrute Force Solution:\nUsing two loops firstly reverse the string of words and compare string of entire words.\n\n# Complexity\n- Time complexity:O(n^2)\n\n- Space complexity:O(n)\n\n# Code\n```\nclass Solution {\npublic:\n    int maximumNumberOfStringPairs(vector<string>& words) {\n        string s;\n        int count = 0;\n        for(int i=0;i<words.size()-1;i++)\n        {\n            for(int j=i+1;j<words.size();j++)\n            {\n                s = words[j];\n                reverse(s.begin(),s.end());\n                if(words[i]==s)    count++;\n            }\n        }\n        return count;\n    }\n};\n```
['C++']