Longest Palindrome

Try to solve the Longest Palindrome problem.


Given a string s that only contains alphabets, return the length of the longest palindrome that may be composed using those letters.

Note: Letters are case-sensitive. Hence, combinations such as “Aa” are not considered palindromes.


  • 11 \leq s.length 2000\leq 2000

  • s consists of lowercase and/or uppercase English letters only.


Create a free account to view this lesson.

By signing up, you agree to Educative's Terms of Service and Privacy Policy