Profitable crime schemes
A group of members can commit crimes. Crime i requires group[i] members and yields profit[i]. A scheme is a subset of crimes; it is profitable if its total profit is at least minProfit and it uses at most n members total (each member can be used by at most one crime, and a chosen crime consumes its full headcount). Return the number of profitable schemes modulo 1000000007. n and minProfit are between 0 and 100, and there are at most 100 crimes.
Implement
profitable_schemes(n: int, minProfit: int, group: list[int], profit: list[int]) → intExamples
in
[5,3,[2,2],[2,3]]out2What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 35 min
solution.py
InputExpectedGot
[5,3,[2,2],[2,3]]2not run yetsample