# README
266. Palindrome Permutation (Easy)
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
Related Topics
[Bit Manipulation] [Hash Table] [String]
Similar Questions
- Longest Palindromic Substring (Medium)
- Valid Anagram (Easy)
- Palindrome Permutation II (Medium)
- Longest Palindrome (Easy)