Given a string
s, return all the palindromic permutations (without duplicates) of it. Return an empty list if no palindromic permutation could be form.
s = "aabb", return
s = "abc", return
The simplest solution is generate every possible permutation of the given string and check if the generated permutation is a palindrome. After this, the palindromic permuations can be added to a in order to eliminate the duplicates. At the end, we can return an array comprised of the elements of this as the resultant array.\n
Let\'s look at the way these permutations are generated. We make use of a recursive function
permute which takes the index of the current element as one of the arguments. Then, it swaps the current element with every other element in the array, lying towards its right, so as to generate a new ordering of the array elements. After the swapping has been done, it makes another call to
permute but this time with the index of the next element in the array. While returning back, we reverse the swapping done in the current function call. Thus, when we reach the end of the array, a new ordering of the array\'s elements is generated.
The animation below depicts the ways the permutations are generated.\n
Time complexity : . A total of permutations are possible. For every permutation generated, we need to check if it is a palindrome, each of which requires time.\n
Space complexity : . The depth of the recursion tree can go upto .\n
It might be possible that no palindromic permutation could be possible for the given string . Thus, it is useless to generate the permutations in such a case. Taking this idea, firstly we check if a palindromic permutation is possible for . If yes, then only we proceed further with generating the permutations. To check this, we make use of a hashmap which stores the number of occurences of each character(out of 128 ASCII characters possible). If the number of characters with odd number of occurences exceeds 1, it indicates that no palindromic permutation is possible for . To look at this checking process in detail, look at Approach 4 of the article for Palindrome Permutation.\n
Once we are sure that a palindromic permutation is possible for , we go for the generation of the required permutations. But, instead of wildly generating all the permutations, we can include some smartness in the generation of permutations i.e. we can generate only those permutations which are already palindromes.\n
One idea to to do so is to generate only the first half of the palindromic string and to append its reverse string to itself to generate the full length palindromic string.\n
Based on this idea, by making use of the number of occurences of the characters in stored in , we create a string which contains all the characters of but with the number of occurences of these characters in reduced to half their original number of occurences in .\n
Thus, now we can generate all the permutations of this string and append the reverse of this permuted string to itself to create the palindromic permutations of .\n
In case of a string with odd length, whose palindromic permutations are possible, one of the characters in must be occuring an odd number of times. We keep a track of this character, , and it is kept separte from the string . We again generate the permutations for similarly and append the reverse of the generated permutation to itself, but we also place the character at the middle of the generated string.\n
In this way, only the required palindromic permutations will be generated. Even if we go with the above idea, a lot of duplicate strings will be generated.\n
In order to avoid generating duplicate palindromic permutations in the first place itself, as much as possible, we can make use of this idea. As discussed in the last approach, we swap the current element with all the elements lying towards its right to generate the permutations. Before swapping, we can check if the elements being swapped are equal. If so, the permutations generated even after swapping the two will be duplicates(redundant). Thus, we need not proceed further in such a case.\n
See this animation for a clearer understanding.\n
Time complexity : . Atmost permutations need to be generated in the worst case. Further, for each permutation generated,
string.reverse() function will take time.
Space complexity : . The depth of recursion tree can go upto in the worst case.\n
Analysis written by: @vinod23\n