# Given a string, write a function to check if it is a permutation of a palindrome

QUESTION:

Palindrome Permutation: Given a string, write a function to check if it is a permutation of a palindrome. A palindrome is a word or phrase that is the same forwards and backwards. A permutation is a rearrangement of letters. The palindrome does not need to be limited to just dictionary words.

EXAMPLE:
Input: Tact Coa
Output: True (permutations: “taco cat’; “atco eta·; etc.)

SOLUTION:

• This is a question where it helps to figure out what it means for a string to be a permutation of a palindrome. This is like asking what the “defining features” of such a string would be.
• A palindrome is a string that is the same forwards and backwards. Therefore, to decide if a string is a permutation of a palindrome, we need to know if it can be written such that it’s the same forwards and backwards.
• What does it take to be able to write a set of characters the same way forwards and backwards? We need to have an even number of almost all characters, so that half can be on one side and half can be on the other side. At most one character (the middle character) can have an odd count.
• For example, we know tactcoapapa is a permutation of a palindrome because it has two Ts, four As, two Cs, two Ps, and one 0. That O would be the center of all possible palindromes.

To be more precise, strings with even length (after removing all non-letter characters) must have all even counts of characters. Strings of an odd length must have exactly one character with an odd count. Of course, an “even” string can’t have an odd number of exactly one character, otherwise it wouldn’t be an even-length string (an odd number+ many even numbers= an odd number). Likewise, a string with odd length can’t have all characters with even counts (sum of evens is even). It’s therefore sufficient to say that, to be a permutation ot a palindrome, a string can have no more than one character that is odd. This will cover both the odd and the even cases.

This leads us to our first algorithm.

Solution #1:

Implementing this algorithm is fairly straightforward. We use a hash table to count how many times each character appears. Then, we iterate through the hash table and ensure that no more than one character has an odd count.

```boolean isPermutationOtfPalindrome(String phrase) {
int[] table = buildCharFrequencyTable(phrase);
return checkMaxOneOdd(table);
}

/* Check that no more than one character has an odd count. */
boolean checkMaxOneOdd(int[] table) {
boolean foundOdd= false;
for  (int  count  :  table) {
if  (count%  2  ==  1)  {
if  (foundOdd)  {
return false;
}
foundOdd= true;
}
}
return true;
}

/* Map each character to a number. a -> 0, b -> 1, c -> 2, etc.
* This is case insensitive. Non-letter characters map to -1. */
int getCharNumber(Character c) {
int  a= Character.getNumericValue('a');
int z = Character.getNumericValue('z');
int val= Character.getNumericValue(c);
if  (a<=  val  &&  val<=  z)  {
return val - a; 28
}
return -1;
}

/* Count how many times each character appears. */
int[] buildCharFrequencyTable(String phrase) {
int[] table new int[Character.getNumericValue('z')
Character.getNumericValue('a') + 1];
for (char c : phrase.toCharArray()) {
int x = getCharNumber(c);
if (x!=-1) {
table[x]++;
}
}
return table;
}```

This algorithm takes O ( N) time, where N is the length of the string.

Solution #2:

• We can’t optimize the big O time here since any algorithm will always have to look through the entire string. However, we can make some smaller incremental improvements. Because this is a relatively simple problem, it can be worthwhile to discuss some small optimizations or at least some tweaks.
• Instead of checking the number of odd counts at the end, we can check as we go along. Then, as soon as we get to the end, we have our answer
```boolean isPermutationOfPalindrome(String phrase) {
int countOdd = 0;
int[] table new int[Character.getNumericValue('z')- Character.getNumericValue('a') + 1];
for (char c phrase.toCharArray()) {
int x = getCharNumber(c);
if (x != -1) {
table[x]++;
if (table[x] % 2 1) {
countOdd++;
} else {
countOdd--;
}
}
}
return countOdd <= 1;
}```
• It’s important to be very clear here that this is not necessarily more optimal. It has the same big O time and might even be slightly slower.
• We have eliminated a final iteration through the hash table, but now we have to run a few extra lines of code for each character in the string.
• You should discuss this with your interviewer as an alternate, but not necessarily more optimal, solution.

Solution #3:

• If you think more deeply about this problem, you might notice that we don’t actually need to know the counts. We just need to know if the count is even or odd. Think about flipping a light on/off (that is initially off).
• If the light winds up in the off state, we don’t know how many times we flipped it, but we do know it was an even count.
• Given this, we can use a single integer (as a bit vector). When we see a letter, we map it to an integer between O and 26 (assuming an English alphabet). Then we toggle the bit at that value. At the end of the iteration, we check that at most one bit in the integer is set to 1.
• We can easily check that no bits in the integer are 1: just compare the integer to 0. There is actually a very elegant way to check that an integer has exactly one bit set to 1.
• Picture an integer like 00010000. We could of course shift the integer repeatedly to check that there’s only a single 1.
• Alternatively, if we subtract 1 from the number, we’ll get 00001111. What’s notable about this is that there is no overlap between the numbers (as opposed to say 00101000, which, when we subtract 1 from, we get 00100111.)
• So, we can check to see that a number has exactly one 1 because if we subtract 1 from it and then AND it with the new number, we should get 0.
• 00010000 – 1 = 00001111
• 00010000 & 00001111 = 0

This leads us to our final implementation.

```boolean isPermutationOfPalindrome(String phrase) {
int bitVector = createBitVector(phrase);
return bitVector == 0 I I checkExactlyOneBitSet(bitVector);
}
/* Create a bit vector for the string. For each letter with value i, toggle the * ith bit. */
int createBitVector(String phrase) {
int bitVector = 0;
1for (char c : phrase.toCharArray()) {
1int x = getCharNumber(c);
1bitVector = toggle(bitVector, x);
}
return bitVector;
}
/* Toggle the ith bit in the integer. */
int toggle(int bitVector, int index) {
if (index < 0) return bitVector;
if ((bitVector & mask) == 0) {
} else {