Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2585. Number of Ways to Earn Points
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source