Given a string, determine if a permutation of the string could form a palindrome.
Example 1:
Input: "code"
Output: false
Example 2:
Input: "aab"
Output: true
Example 3:
Input: "carerac"
Output: true
[Hash Table] [String] [Bit Manipulation]
- Longest Palindromic Substring (Medium)
- Valid Anagram (Easy)
- Palindrome Permutation II (Medium)
- Longest Palindrome (Easy)