266. Palindrome Permutation

Problem

Return true if any permutation of the string can form a palindrome.

Given a string s, determine if any permutation of s can form a palindrome. A palindrome reads the same forwards and backwards.

Examples
Input: "code"
Output: false
Hints
Related Problems

266. Palindrome Permutation

Return true if any permutation of the string can form a palindrome.