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 | 力扣

• Tags: Dynamic Programming

1981. Minimize the Difference Between Target and Chosen Elements

• LeetCode | 力扣

• Tags: Array, Dynamic Programming, Matrix

2218. Maximum Value of K Coins From Piles

• LeetCode | 力扣

• Tags: Array, Dynamic Programming, Prefix Sum

Comments