Knapsack Problem Questions
0-1 Knapsack Problem
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
Multi-dimensional Knapsack Problem