Leetcode 267. Palindrome Permutation II

Given a string, return all distinct palindromic permutations (or an empty list if none exist) by first checking character counts allow at most one odd count. If feasible, build a half-string from counts and generate unique permutations of that half, mirroring each to form full palindromes.