Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
879. Profitable Schemes
Bookmark
Recursion
Memoization
Dynamic Programming
Input
Standard
Medium
Small
Custom
n
=
5
,
minProfit
=
3
,
group
=
[2, 2]
,
profit
=
[2, 3]
crimes g/p
2
/
2
2
/
3
n =
5
minProfit =
3
profit floor k (caps at 3)
0
1
2
3
members j
0
1
2
3
4
5
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
count schemes with at most 5 members and at least 3 profit
crimes g/p
2
/
2
2
/
3
n =
5
minProfit =
3
profit floor k (caps at 3)
0
1
2
3
members j
0
1
2
3
4
5
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
count schemes with at most 5 members and at least 3 profit
crimes g/p
2
/
2
2
/
3
n =
5
minProfit =
3
i
profit floor k (caps at 3)
0
1
2
3
members j
0
1
2
3
4
5
1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
dp[
3
][
2
] =
0
no schemes to extend, dp[5][3] unchanged
crimes g/p
2
/
2
2
/
3
n =
5
minProfit =
3
i
profit floor k (caps at 3)
0
1
2
3
members j
0
1
2
3
4
5
1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
dp[
2
][
0
] =
0
no schemes to extend, dp[4][2] unchanged
crimes g/p
2
/
2
2
/
3
n =
5
minProfit =
3
i
profit floor k (caps at 3)
0
1
2
3
members j
0
1
2
3
4
5
1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
dp[
0
][
3
] =
0
no schemes to extend, dp[2][3] unchanged
crimes g/p
2
/
2
2
/
3
n =
5
minProfit =
3
i
profit floor k (caps at 3)
0
1
2
3
members j
0
1
2
3
4
5
1
0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
0
0
0
0
0
crime 1
g =
2
members, p =
3
profit
crimes g/p
2
/
2
2
/
3
n =
5
minProfit =
3
i
profit floor k (caps at 3)
0
1
2
3
members j
0
1
2
3
4
5
1
0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
0
0
0
0
0
dp[
2
][
3
] =
0
no schemes to extend, dp[4][3] unchanged
crimes g/p
2
/
2
2
/
3
n =
5
minProfit =
3
i
profit floor k (caps at 3)
0
1
2
3
members j
0
1
2
3
4
5
1
0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
1
0
0
0
0
dp[
1
][
3
] =
0
no schemes to extend, dp[3][3] unchanged
crimes g/p
2
/
2
2
/
3
n =
5
minProfit =
3
i
profit floor k (caps at 3)
0
1
2
3
members j
0
1
2
3
4
5
1
0
0
0
0
0
0
0
0
0
1
0
0
0
0
0
0
0
0
1
0
0
0
0
dp[
0
][
2
] =
0
no schemes to extend, dp[2][3] unchanged
crimes g/p
2
/
2
2
/
3
n =
5
minProfit =
3
profit floor k (caps at 3)
0
1
2
3
members j
0
1
2
3
4
5
1
0
0
0
0
0
0
0
0
0
1
1
0
0
0
0
0
0
0
1
0
0
0
0
result
+= dp[
1
][3] =
0
→
0
crimes g/p
2
/
2
2
/
3
n =
5
minProfit =
3
profit floor k (caps at 3)
0
1
2
3
members j
0
1
2
3
4
5
1
0
0
0
0
0
0
0
0
0
1
1
0
0
0
0
0
0
0
1
0
0
0
0
2
profitable schemes
algo
master
.
io
Step:
Count the schemes that use at most 5 members and earn at least 3 profit
0 / 48
Input
Standard
Medium
Small
Custom
n
=
5
,
minProfit
=
3
,
group
=
[2, 2]
,
profit
=
[2, 3]
0 / 48
algo
master
.
io
Step:
Count the schemes that use at most 5 members and earn at least 3 profit
