Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3646. Next Special Palindrome Number
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.
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.