Easy solution || C++
Code\n\nclass Solution {\npublic:\n    int maximumNumberOfStringPairs(vector<string>& words) {\n        int count=0;\n        for(int i=0;i<words.size();i++){\n
# Code\n```\nclass Solution {\npublic:\n    int maximumNumberOfStringPairs(vector<string>& words) {\n        int count=0;\n        for(int i=0;i<words.size();i++){\n            for(int j=i+1;j<words.size();j++){\n                if(words[i]==palindrome(words[j])){\n                    count++;\n                }\n            }\n        }\n\n        return count;\n    }\n\n    string palindrome(string s){\n        string st(s.size(), \' \');\n        int n=s.size();\n        for(int i=0;i<s.size();i++){\n            st[i]=s[n-i-1];\n        }\n        return st;\n    }\n\n};\n```
['Array', 'String', 'C++']