Knapsack Problems
About 1 min
Knapsack Problem Questions
0-1 Knapsack Problem
No. | Title | Solution | Tags | Difficulty |
---|---|---|---|---|
0416 | Partition Equal Subset Sum | [[LeetCode XXXX]] | Array, Dynamic Programming | Medium |
0494 | Target Sum | [[LeetCode XXXX]] | Array, Dynamic Programming, Backtracking | Medium |
1049 | Last Stone Weight II | [[LeetCode XXXX]] | Array, Dynamic Programming | Medium |
Unbounded Knapsack Problem
No. | Title | Solution | Tags | Difficulty |
---|---|---|---|---|
0279 | Perfect Squares | [[LeetCode XXXX]] | Breadth-First Search, Math, Dynamic Programming | Medium |
0322 | Coin Change | [[LeetCode XXXX]] | Breadth-First Search, Array, Dynamic Programming | Medium |
0518 | Coin Change 2 | [[LeetCode XXXX]] | Array, Dynamic Programming | Medium |
0139 | Word Break | [[LeetCode XXXX]] | Trie, Memoization, Array, Hash Table, String, Dynamic Programming | Medium |
0377 | Combination Sum IV | [[LeetCode XXXX]] | Array, Dynamic Programming | Medium |
0638 | Shopping Offers | Bit Manipulation, Memoization, Array, Dynamic Programming, Backtracking, State Compression | Medium | |
1449 | Form Largest Integer With Digits That Add up to Target | [[LeetCode XXXX]] | Array, Dynamic Programming | Hard |
Multiple Knapsack Problem
Group Knapsack Problem
No. | Title | Solution | Tags | Difficulty |
---|---|---|---|---|
1155 | Number of Dice Rolls With Target Sum | [[LeetCode XXXX]] | Dynamic Programming | Medium |
2585 | Number of Ways to Earn Points | [[LeetCode XXXX]] | Array, Dynamic Programming | Hard |
Multi-dimensional Knapsack Problem
No. | Title | Solution | Tags | Difficulty |
---|---|---|---|---|
0474 | Ones and Zeroes | [[LeetCode XXXX]] | Array, String, Dynamic Programming | Medium |
0879 | Profitable Schemes | Array, Dynamic Programming | Hard | |
1995 | Count Special Quadruplets | Array, Enumeration | Easy |