Palindrome Permutation

Try to solve the Palindrome Permutation problem.


For a given string, st, find whether or not a permutation of this string is a palindromePalindrome is a string of characters that reads the same forwards and backwards. For example, “ababa” and “xyxxyx” are palindromes.. You should return TRUE if such a permutation is possible and FALSE if it isn’t possible.


  • 11 \leq st.length 1000\leq 1000
  • The string will contain lowercase English letters.


Create a free account to view this lesson.

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