Search
⌘K
Get Premium
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.