Leetcode 879. Profitable Schemes

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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 879. Profitable Schemes

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact