Leetcode 357. Count Numbers with Unique Digits

Count how many integers x in [0, 10^n) have all distinct digits. This is a combinatorics problem: compute counts for each digit-length by using permutations of available digits (n ≤ 8 so at most 10 possible digits).