Leetcode Problem 267. Palindrome Permutation II

267. Palindrome Permutation II

Leetcode Solutions

Create a hashmap to count the occurrences of each character in s.
Check if a palindromic permutation is possible by ensuring at most one character has an odd count.
Form a string st with half the occurrences of each character (and one odd-count character, if any).
Use backtracking to generate permutations of st.
For each permutation, create a palindrome by appending the reverse of the permutation (and the odd-count character in the middle, if any).
Return the list of generated palindromic permutations.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen