Leetcode: Palindrome Permutation II

Palindrome Permutation II



Similar Problems:


Given a string s, return all the palindromic permutations (without duplicates) of it. Return an empty list if no palindromic permutation could be form.

For example:

Given s = "aabb", return ["abba", "baab"].

Given s = "abc", return [].

Github: code.dennyzhang.com

Credits To: leetcode.com

Leave me comments, if you have better ways to solve.


## Blog link: https://code.dennyzhang.com/palindrome-permutation-ii
linkedin
github
slack

Share It, If You Like It.

Leave a Reply

Your email address will not be published.