Find maximum number of string pairs -Easy solution for beginner -->
Intuition\n\n\n# Approach\nreversing the string and placing it in the words array and checking it with variable a.\n\n# Complexity\n- Time complexity:\n\n\n- Sp
# Intuition\n\n\n# Approach\nreversing the string and placing it in the words array and checking it with variable a.\n\n# Complexity\n- Time complexity:\n\n\n- Space complexity:\n\n\n# Code\n```cpp []\nclass Solution {\npublic:\n    int maximumNumberOfStringPairs(vector<string>& words) {\n        int c = 0;\n        for(int i = 0;i < words.size(); i++){\n            \n            string a = words[i];\n\n            for(int j = i+1;j < words.size(); j++){\n\n                reverse(words[j].begin(),words[j].end());\n\n                if(a == words[j]){\n                    c++;\n                }\n            }\n        }\n        return c;\n    }\n};\n```
['C++']