EASY C++ SOLUTION WITH MINIMAL CONCEPTS
EASY C++ SOLUTION WITH MINIMAL CONCEPTS\n\n\n# Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to
**EASY C++ SOLUTION WITH MINIMAL CONCEPTS**\n\n\n# 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 {\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                string temp=words[j];\n                reverse(temp.begin(),temp.end()); // Storing the string array element in temporary string variable and reversing it for checking .\n                if(words[i]==temp) count++;\n            }\n        }\n    return count;   \n    }\n};\n```
['C++']