Leetcode 3533. Concatenated Divisibility

Given nums and k, find the lexicographically smallest permutation of nums whose concatenated decimal representation is divisible by k (or return [] if none). The core challenge is combinatorial search with modular arithmetic — typically solved by bitmask DP over subsets and remainders to test feasibility and reconstruct the smallest valid ordering.