Java Solution || Using StringBuilder
Intuition\n Describe your first thoughts on how to solve this problem. \nWe have to find whether the reverse of a string at words[i] is present at index j such 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\nWe have to find whether the reverse of a string at words[i] is present at index j such that 0<=i<j<words.length and return the count of such pairs found.\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\nI have used two for loops one from i=0 to words.length and inside it from j=i+1 to words.length and stored the words[j] in a string builder and compared it to the words[i] by reversing the one at index j and after the comparison has taken place then emtpying the stringbuilder so that new string can be stored in it.\n\n# Code\n```\nclass Solution {\n    public int maximumNumberOfStringPairs(String[] words) {\n        int count = 0;\n        StringBuilder sb = new StringBuilder();\n        for(int i=0;i<words.length;i++){\n            for(int j=i+1;j<words.length;j++){\n                sb.append(words[j]);\n                if(words[i].equals(sb.reverse().toString())){\n                    count++;\n                }\n                sb.delete(0,sb.length());\n            }\n        }\n        return count;\n    }\n}\n```\n\n![oie_CksRiTNvbciG.jpg](https://assets.leetcode.com/users/images/789fb96d-4a96-464c-a4ee-ea8b1f844689_1688829277.9101799.jpeg)
['Java']