Leetcode 3032. Count Numbers With Unique Digits II

Given n, count how many non-negative integers less than 10^n have all distinct digits (no repeated digits), including 0 and shorter numbers. The core challenge is combinatorics: sum the permutations for each possible digit length while handling the first-digit/leading-zero constraints.