DP Grouped Knapsack¶
Table of Contents¶
- 1155. Number of Dice Rolls With Target Sum (Medium)
- 1981. Minimize the Difference Between Target and Chosen Elements (Medium)
- 2218. Maximum Value of K Coins From Piles (Hard)
1155. Number of Dice Rolls With Target Sum¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: dynamic programming
1981. Minimize the Difference Between Target and Chosen Elements¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, dynamic programming, matrix
2218. Maximum Value of K Coins From Piles¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, dynamic programming, prefix sum