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.