Palindrome Permutation

Statement

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.

Constraints:

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

Examples