Search
⌘K
Leetcode 2585. Number of Ways to Earn Points
Count the number of combinations to reach exactly target points using up to count_i indistinguishable items worth marks_i each (order doesn't matter) — a bounded knapsack / coin-change counting problem; return the result modulo 10^9+7 (target ≤ 1000, n ≤ 50).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Hello Interview Premium
Your account is free and you can post anonymously if you choose.