Leetcode 2999. Count the Number of Powerful Integers

Count how many integers in [start, finish] have decimal representation ending with the given suffix s and whose every digit is ≤ limit; the core challenge is to enumerate valid prefixes (of varying length) under per-digit bounds and range constraints, typically solved with digit-DP or combinatorial counting across possible prefix lengths for values up to 10^15.