Knapsack
Knapsack DP
·2 mins
Algorithm
Dynamic-Programming
Knapsack
Subset-Sum
0/1, unbounded, reachability, counting, and optimization states
LeetCode 494: Target Sum
·3 mins
LeetCode
Medium
Dynamic-Programming
Knapsack
Subset-Sum
LeetCode note for Target Sum, rebuilt from the original learning note
LeetCode 416: Partition Equal Subset Sum
·3 mins
LeetCode
Medium
Dynamic-Programming
Knapsack
Subset-Sum
LeetCode note for Partition Equal Subset Sum, rebuilt from the original learning note
LeetCode 879: Profitable Schemes
·3 mins
LeetCode
Hard
Dynamic-Programming
Knapsack
LeetCode note for Profitable Schemes, rebuilt from the original learning note
LeetCode 474: Ones and Zeroes
·3 mins
LeetCode
Medium
Dynamic-Programming
Knapsack
LeetCode note for Ones and Zeroes, rebuilt from the original learning note
LeetCode 1449: Form Largest Integer With Digits That Add Up To Target
·3 mins
LeetCode
Hard
Dynamic-Programming
Knapsack
LeetCode note for Form Largest Integer With Digits That Add Up To Target, rebuilt from the original learning note
LeetCode 1049: Last Stone Weight II
·3 mins
LeetCode
Medium
Dynamic-Programming
Knapsack
Subset-Sum
LeetCode note for Last Stone Weight II, rebuilt from the original learning note