Good To Go ✅🚀
\n# Code\njava []\n\n// This approcah is used to solve 2131. Longest Palindrome by Concatenating Two Letter Words\n\n\nclass Solution {\n    public int maximumN
\n# Code\n```java []\n\n// This approcah is used to solve 2131. Longest Palindrome by Concatenating Two Letter Words\n\n\nclass Solution {\n    public int maximumNumberOfStringPairs(String[] words) {\n        int ans = 0;\n        HashMap<String, Integer> map = new HashMap<>();\n        \n        for (String w : words) {\n            // Reverse the current string\n            StringBuilder reversed = new StringBuilder(w).reverse();\n            String reversedStr = reversed.toString();\n            \n            // Check if the reversed string exists in the map\n            if (map.getOrDefault(reversedStr, 0) > 0) {\n                ans++;\n                map.put(reversedStr, map.get(reversedStr) - 1);\n            } else {\n                map.put(w, map.getOrDefault(w, 0) + 1);\n            }\n        }\n        \n        return ans;\n    }\n}\n\n\n```
['Hash Table', 'Java']