Available question text
Find the smallest integer > n that is a palindrome and whose digit multiset satisfies "each digit k appears either 0 or exactly k times." The core challenge is to enumerate the limited subsets of digits (2^9 possibilities, with at most one odd-count to allow a palindrome) and construct the smallest palindrome from each candidate set to pick the minimal number greater than n.
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 3646. Next Special Palindrome Number
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source