Leetcode 377. Combination Sum IV

Count how many ordered sequences (elements may be reused) of distinct positive integers from nums sum to target — order matters so different permutations are counted separately. Core challenge: this is an order-sensitive unbounded knapsack / permutation-counting problem typically solved with dynamic programming (answers fit in 32-bit).