Available question text
Count how many subsets of crimes use at most n members while achieving total profit at least minProfit; this is a 0/1 knapsack-style counting problem solved with dynamic programming over members and profit (profit dimension can be capped at minProfit) with results modulo 1e9+7.
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 879. Profitable Schemes
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source