Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 267. Palindrome Permutation II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source