Given a string s
, return all the palindromic permutations (without duplicates) of it. Return an empty list if no palindromic permutation could be form.
Example 1:
Input:"aabb"
Output:["abba", "baab"]
Example 2:
Input:"abc"
Output:[]
[Hash Table] [String] [Backtracking]
- Next Permutation (Medium)
- Permutations II (Medium)
- Palindrome Permutation (Easy)