Tap here to switch tabs
Problem
Submissions

Problem: Palindrome Permutation

Palindrome Permutation asks whether the letters of a given string can be rearranged into a palindrome. Return TRUE if any such ordering exists and FALSE otherwise.

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≤1 \leq st.length ≤1000\leq 1000
  • The string will contain lowercase English letters.
⋮
Tap here to switch tabs
Problem
Submissions

Problem: Palindrome Permutation

Palindrome Permutation asks whether the letters of a given string can be rearranged into a palindrome. Return TRUE if any such ordering exists and FALSE otherwise.

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≤1 \leq st.length ≤1000\leq 1000
  • The string will contain lowercase English letters.