266. Palindrome Permutation

Easy

Hash Table

String

Bit Manipulation

From doocs/leetcode

Given a string s, return true if a permutation of the string could form a palindrome and false otherwise.

Example 1:

Input: s = "code"
Output: false

Example 2:

Input: s = "aab"
Output: true

Example 3:

Input: s = "carerac"
Output: true

Constraints:

Hint 1

Consider the palindromes of odd vs even length. What difference do you notice?

Hint 2

Count the frequency of each character.

Hint 3

If each character occurs even number of times, then it must be a palindrome. How about character which occurs odd number of times?

Acceptance

68.6%

Submissions

338,689

Accepted

232,343