PalindromePermutation

PalindromePermutation.cpp

#include <bits/stdc++.h>
using namespace std;

int bitVector,mask;
string str;

bool powerof2(int x){
    return (x&(x-1))==0;
}

void toggle(int x){
    mask=1<<x;
    if((bitVector&mask) == 0)
        bitVector|=mask;
    else
        bitVector&=~mask;
}

bool isPermutationOfPalindrome(){
    for(char c:str){
        int x=c-'a';
        toggle(x);
    }
    return bitVector==0 or powerof2(bitVector);
}

int main() {
	cin>>str;
	if(isPermutationOfPalindrome())
	    cout<<"YES"<<endl;
	else
	    cout<<"NO"<<endl;
	return 0;
}