# 266 Palindromic Permutation

Problem Description:

Given a string, determine if a permutation of the string could form a palindrome.

For example, "code" -> False, "aab" -> True, "carerac" -> True.

That is that it reads the same forwards as backwards like “racecar”.

Hint:

Consider the palindromes of odd vs even length. What difference do you notice? Count the frequency of each character. If each character occurs even number of times, then it must be a palindrome. How about character which occurs odd number of times?

```cpp
  #include <iostream>
  #include <unordered_map>
  using namespace std;

  bool palindromic(string word) 
  {
      unordered_map <char, int> wordCount;
      for (auto i : word) ++wordCount[i];

      if (word.size() - 1 % 2 == 0) // even
      {
          for (auto &i : wordCount)
          {
              if (i.second == 2) continue;
              else return false;
          }
          return true;
      }
      else // odd
      {
          int count = 0;
          for (auto &i : wordCount)
          {
              if (i.second == 2) continue;
              else if (i.second == 1) count++;
              if (count > 1) return false;
          }
          return true;
      }

  }

  int main()
  {
      cout << palindromic("aabbccddeefghf");
  }
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://maksimdan.gitbook.io/interview-practice-problems/leetcode_sessions/palindromic_permutation_266.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.