☑️✅Easy C++ Solution || 100% faster✅☑️
\n\n\n# LINK TO MY SUBMISSION: - SUBMITTED\n# If you like the solution kindly upvote the solution\n\n\n#define n 26\n\nclass Solution {\npublic:\n    Solution()
![image](https://assets.leetcode.com/users/images/3edab13c-e3a6-4b33-a53d-167ab5af967b_1667436582.3112164.png)\n\n\n# LINK TO MY SUBMISSION: - [SUBMITTED](https://leetcode.com/submissions/detail/835721690/)\n# If you like the solution kindly upvote the solution\n\n```\n#define n 26\n\nclass Solution {\npublic:\n    Solution() {\n        ios_base::sync_with_stdio(0);\n    }\n    \n    int longestPalindrome(vector<string>& words) {\n        int len = 0, arr[n][n] = { 0 };\n        for (string& s : words) {\n            if (!arr[s.front() - \'a\'][s.back() - \'a\']) ++arr[s.back() - \'a\'][s.front() - \'a\'];\n            else len += 4, --arr[s.front() - \'a\'][s.back() - \'a\'];\n        }\n        for (int i = 0; i < n; ++i) if (arr[i][i] & 1) {\n            len += 2;\n            break;\n        }\n        return len;\n    }\n};\n```\n\n\n\n# UPVOTE
['C']