Palindrome Permutation - Problem Statement

Determine if a permutation of a given string S can form a palindrome.

Example:

Input:

string S = "aab"

Output:

"True"

Explanation:

The permutation "aba" of the string "aab" is a palindrome.

Constraints:

• 1 <= T <= 10
• 1 <= Length of the given string <= 105
• All characters in the strings are lowercase English alphabets.
• Time Limit: 1sec

Note:

You do not need to print anything; just implement the given function.