Easy Bruteforce
\nclass Solution {\n    public static int maximumNumberOfStringPairs(String[] words) {\n        int ans=0;\n        for(int i=0;i<words.length;i++){\n          
```\nclass Solution {\n    public static int maximumNumberOfStringPairs(String[] words) {\n        int ans=0;\n        for(int i=0;i<words.length;i++){\n            for(int j=i+1;j<words.length;j++){\n                if(words[i].equals(reverse(words[j]))){\n                   // System.out.println(words[i]);\n                    ans++;\n                }\n            }\n        }\n        return ans;\n    }\n    public static String  reverse(String str) {\n        String ans="";\n        ans+=str.charAt(1);\n        ans+=str.charAt(0);\n        return ans;\n    }\n}\n```
['Array', 'Java']