Partition a string into palindromic strings of at least length 2 with every character present in a single string

  #include using namespace std;  void checkPalindrome(string& s){            int a[26] = { 0 };                  int o = 0, e = 0;          for (int i = 0; s[i] != ‘’; i++)        a[(int)s[i] – 97]++;          for (int i = 0; i < 26; i++) {                  if (a[i] == 1)            o++;                  else if (a[i] % 2 == 0                 and a[i] != 0)            e += (a[i] / 2);    }          if (e >= o)        cout 2) {                  int k = o;                                  o = o – a[i] / 2;                                                  if (o > 0 or 2 * k + 1 == a[i]) {                                          o++;                                          a[i] = 1;                }            }        }                  if (o