# Count of pairs of strings whose concatenation forms a palindromic string

Given an array **A[ ]** consisting of **N** strings, the task is to count the number of pairs of possible strings that on merging forms a **Palindromic String** or can be rearranged to form a Palindromic String.

**Example :**

Input:N = 6, A[ ] = {aab, abcac, dffe, ed, aa, aade}Output:6Explanation:

All possible pairs of strings which generates a palindromic string:

{aab, abcac} = aabccbaa

{aab, aa} = aabaa

{abcac, aa} = aacbcaa

{dffe, ed} = fdeedf

{dffe, aade} = edfaafde

{ed, aade} = edaade or aeddea

Hence, total possible pairs = 6

Input:N = 3, A[ ] = {aa, bb, cd}Output:1Explanation:

The only possible pair of strings which generates palindromic string:

{aa, bb} = abba

Hence, total possible pairs = 1

**Naive Approach:**

The simplest approach to solve this problem is to generate all possible pairs from the given array and merge these pairs to generate new strings. For each of those merged strings, generate all possible permutations of the string and for each permutation, check whether it is a palindromic string or not and increment the count accordingly. **Time Complexity:** O(N^{2 }* L! * L), where L is the maximum length of a string.**Auxiliary Space: **O(M)

**Efficient Approach:**

A palindromic string can always be formed when * at most one character* has an

*occurrence and remaining every character has even occurrence. Since rearrangement of the characters in the merged string is allowed, so we only need to count the frequency of characters in the merged string and check if it satisfies to be a palindromic string or not.*

**odd**

Illustration:1. Every character has even occurrence

Strings“aab”and“abcac”can be merged and rearranged to form a palindromic string “aababcac”with each character having even frequency

2. One character has odd occurrence

Strings“aab”and“aa”can be merged to form a palindromic string “aabaa”with a character(‘b’) having odd frequency and the rest having even frequency.

Hence, it can be observed that two pairs of strings of the following types can be merged to form a palindromic string:

- The frequency of each character in both strings are
.**same** - At most one character in both the strings has a
frequency.**different**

Follow the steps below to solve the problem:

- Traverse the given array and for every string, store the frequency of each character.
- Assign
to each frequency. Assign**parity (0**or**1)****0**for even frequency and**1**for odd frequency. - Initialize a map to store the frequencies of each frequency array generated.
- Since, rearrangement is allowed, reverse the parity of each character and include the frequency array in map.
- Finally, return the total count of similar frequency arrays, which will give the required count of pairs.

Below is the implementation of the above approach:

## C++

`// C++ Program to find` `// palindromic string` `#include <bits/stdc++.h>` `using` `namespace` `std;` `int` `getCount(` `int` `N, vector<string>& s)` `{` ` ` `// Stores frequency array` ` ` `// and its count` ` ` `map<vector<` `int` `>, ` `int` `> mp;` ` ` `// Total number of pairs` ` ` `int` `ans = 0;` ` ` `for` `(` `int` `i = 0; i < N; i++) {` ` ` `// Initializing array of size 26` ` ` `// to store count of character` ` ` `vector<` `int` `> a(26, 0);` ` ` `// Counting occurrence of each` ` ` `// character of current string` ` ` `for` `(` `int` `j = 0; j < s[i].size(); j++) {` ` ` `a[s[i][j] - ` `'a'` `]++;` ` ` `}` ` ` `// Convert each count to parity(0 or 1)` ` ` `// on the basis of its frequency` ` ` `for` `(` `int` `j = 0; j < 26; j++) {` ` ` `a[j] = a[j] % 2;` ` ` `}` ` ` `// Adding to answer` ` ` `ans += mp[a];` ` ` `// Frequency of single character` ` ` `// can be possibly changed,` ` ` `// so change its parity` ` ` `for` `(` `int` `j = 0; j < 26; j++) {` ` ` `vector<` `int` `> changedCount = a;` ` ` `if` `(a[j] == 0)` ` ` `changedCount[j] = 1;` ` ` `else` ` ` `changedCount[j] = 0;` ` ` `ans += mp[changedCount];` ` ` `}` ` ` `mp[a]++;` ` ` `}` ` ` `return` `ans;` `}` `int` `main()` `{` ` ` `int` `N = 6;` ` ` `vector<string> A` ` ` `= { ` `"aab"` `, ` `"abcac"` `, ` `"dffe"` `,` ` ` `"ed"` `, ` `"aa"` `, ` `"aade"` `};` ` ` `cout << getCount(N, A);` ` ` `return` `0;` `}` |

## Java

`// Java program to find` `// palindromic string` `import` `java.util.*;` `class` `GFG{` `static` `int` `getCount(` `int` `N, List<String> s)` `{` ` ` ` ` `// Stores frequency array` ` ` `// and its count` ` ` `Map<List<Integer>, Integer> mp = ` `new` `HashMap<>();` ` ` ` ` `// Total number of pairs` ` ` `int` `ans = ` `0` `;` ` ` ` ` `for` `(` `int` `i = ` `0` `; i < N; i++)` ` ` `{` ` ` ` ` `// Initializing array of size 26` ` ` `// to store count of character` ` ` `List<Integer> a = ` `new` `ArrayList<>(` `26` `);` ` ` `for` `(` `int` `k = ` `0` `; k < ` `26` `; k++)` ` ` `a.add(` `0` `);` ` ` ` ` `// Counting occurrence of each` ` ` `// character of current string` ` ` `for` `(` `int` `j = ` `0` `; j < s.get(i).length(); j++)` ` ` `{` ` ` `a.set((s.get(i).charAt(j) - ` `'a'` `),` ` ` `a.get(s.get(i).charAt(j) - ` `'a'` `) + ` `1` `);` ` ` `}` ` ` `// Convert each count to parity(0 or 1)` ` ` `// on the basis of its frequency` ` ` `for` `(` `int` `j = ` `0` `; j < ` `26` `; j++)` ` ` `{` ` ` `a.set(j, a.get(j) % ` `2` `);` ` ` `}` ` ` ` ` `// Adding to answer` ` ` `ans += mp.getOrDefault(a, ` `0` `);` ` ` ` ` `// Frequency of single character` ` ` `// can be possibly changed,` ` ` `// so change its parity` ` ` `for` `(` `int` `j = ` `0` `; j < ` `26` `; j++)` ` ` `{` ` ` `List<Integer> changedCount = ` `new` `ArrayList<>();` ` ` `changedCount.addAll(a);` ` ` ` ` `if` `(a.get(j) == ` `0` `)` ` ` `changedCount.set(j, ` `1` `);` ` ` `else` ` ` `changedCount.set(j, ` `0` `);` ` ` ` ` `ans += mp.getOrDefault(changedCount, ` `0` `);` ` ` `}` ` ` `mp.put(a, mp.getOrDefault(a, ` `0` `) + ` `1` `);` ` ` `}` ` ` `return` `ans;` `}` `// Driver code` `public` `static` `void` `main (String[] args)` `{` ` ` `int` `N = ` `6` `;` ` ` `List<String> A = Arrays.asList(` `"aab"` `, ` `"abcac"` `,` ` ` `"dffe"` `, ` `"ed"` `,` ` ` `"aa"` `, ` `"aade"` `);` ` ` ` ` `System.out.print(getCount(N, A));` `}` `}` `// This code is contributed by offbeat` |

## Python3

`# Python3 program to find` `# palindromic string` `from` `collections ` `import` `defaultdict` `def` `getCount(N, s):` ` ` `# Stores frequency array` ` ` `# and its count` ` ` `mp ` `=` `defaultdict(` `lambda` `: ` `0` `)` ` ` `# Total number of pairs` ` ` `ans ` `=` `0` ` ` `for` `i ` `in` `range` `(N):` ` ` `# Initializing array of size 26` ` ` `# to store count of character` ` ` `a ` `=` `[` `0` `] ` `*` `26` ` ` `# Counting occurrence of each` ` ` `# character of current string` ` ` `for` `j ` `in` `range` `(` `len` `(s[i])):` ` ` `a[` `ord` `(s[i][j]) ` `-` `ord` `(` `'a'` `)] ` `+` `=` `1` ` ` `# Convert each count to parity(0 or 1)` ` ` `# on the basis of its frequency` ` ` `for` `j ` `in` `range` `(` `26` `):` ` ` `a[j] ` `=` `a[j] ` `%` `2` ` ` `# Adding to answer` ` ` `ans ` `+` `=` `mp[` `tuple` `(a)]` ` ` `# Frequency of single character` ` ` `# can be possibly changed,` ` ` `# so change its parity` ` ` `for` `j ` `in` `range` `(` `26` `):` ` ` `changedCount ` `=` `a[:]` ` ` `if` `(a[j] ` `=` `=` `0` `):` ` ` `changedCount[j] ` `=` `1` ` ` `else` `:` ` ` `changedCount[j] ` `=` `0` ` ` `ans ` `+` `=` `mp[` `tuple` `(changedCount)]` ` ` `mp[` `tuple` `(a)] ` `+` `=` `1` ` ` `return` `ans` `# Driver code` `if` `__name__ ` `=` `=` `'__main__'` `:` ` ` ` ` `N ` `=` `6` ` ` `A ` `=` `[ ` `"aab"` `, ` `"abcac"` `, ` `"dffe"` `,` ` ` `"ed"` `, ` `"aa"` `, ` `"aade"` `]` ` ` `print` `(getCount(N, A))` `# This code is contributed by Shivam Singh` |

**Output:**

6

**Time Complexity:** O(N*(L+log(N))), where L is the maximum length of a string**Auxiliary Space: **O(N)