Hands$-$On Programml...

Jumble the strings!

john comes across a problem involving palindromes and, while working on it$,$ gets stuck at some point, and asks for your help. He is to perform some operations on them.

He gives you an array of $N$ strings, whe strings in the array can lowercase English alphabets. Any two the chares can be rearranged to form a concatenated to che the task is to return the count of such string pairs "bac" can be concaten "abccba" For example $-$ strings $"abc"$ and be rearranged to form "abct "abcbac" whose characte.

which is a palin

ay of $N$ strings

input$1$: An array $N$ denoting the length of the array

Output Specification:

Return an integer value representina the num